/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/parallel-parallel-sum-1-dsl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:19:34,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:19:34,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:19:34,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:19:34,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:19:34,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:19:34,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:19:34,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:19:34,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:19:34,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:19:34,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:19:34,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:19:34,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:19:34,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:19:34,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:19:34,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:19:34,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:19:34,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:19:34,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:19:34,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:19:34,587 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:19:34,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:19:34,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:19:34,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:19:34,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:19:34,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:19:34,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:19:34,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:19:34,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:19:34,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:19:34,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:19:34,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:19:34,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:19:34,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:19:34,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:19:34,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:19:34,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:19:34,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:19:34,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:19:34,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:19:34,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:19:34,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:19:34,612 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:19:34,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:19:34,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:19:34,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:19:34,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:19:34,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:19:34,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:19:34,646 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:19:34,646 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:19:34,646 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:19:34,646 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:19:34,647 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:19:34,647 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:19:34,647 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:19:34,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:19:34,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:19:34,648 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:19:34,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:19:34,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:19:34,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:19:34,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:19:34,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:19:34,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:19:34,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:19:34,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:19:34,650 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:19:34,650 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:19:34,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:19:34,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:19:34,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:19:34,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:19:34,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:19:34,652 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:19:34,652 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:19:35,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:19:35,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:19:35,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:19:35,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:19:35,081 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:19:35,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2022-07-22 12:19:35,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b861e856/35622c97ce30463b93dced415925474d/FLAG1da2b0d5a [2022-07-22 12:19:35,751 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:19:35,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2022-07-22 12:19:35,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b861e856/35622c97ce30463b93dced415925474d/FLAG1da2b0d5a [2022-07-22 12:19:36,119 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b861e856/35622c97ce30463b93dced415925474d [2022-07-22 12:19:36,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:19:36,131 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:19:36,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:19:36,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:19:36,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:19:36,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:19:36" (1/1) ... [2022-07-22 12:19:36,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aab57f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:36, skipping insertion in model container [2022-07-22 12:19:36,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:19:36" (1/1) ... [2022-07-22 12:19:36,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:19:36,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:19:36,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2022-07-22 12:19:36,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:19:36,397 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:19:36,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2022-07-22 12:19:36,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:19:36,454 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:19:36,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:36 WrapperNode [2022-07-22 12:19:36,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:19:36,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:19:36,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:19:36,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:19:36,464 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:19:36" (1/1) ... [2022-07-22 12:19:36,476 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:19:36" (1/1) ... [2022-07-22 12:19:36,512 INFO L137 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 275 [2022-07-22 12:19:36,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:19:36,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:19:36,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:19:36,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:19:36,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:36" (1/1) ... [2022-07-22 12:19:36,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:36" (1/1) ... [2022-07-22 12:19:36,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:36" (1/1) ... [2022-07-22 12:19:36,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:36" (1/1) ... [2022-07-22 12:19:36,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:36" (1/1) ... [2022-07-22 12:19:36,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:36" (1/1) ... [2022-07-22 12:19:36,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:36" (1/1) ... [2022-07-22 12:19:36,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:19:36,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:19:36,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:19:36,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:19:36,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:36" (1/1) ... [2022-07-22 12:19:36,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:36,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:36,623 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:19:36,625 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:19:36,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:19:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:19:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:19:36,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:19:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:19:36,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:19:36,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:19:36,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:19:36,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:19:36,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:19:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-22 12:19:36,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-22 12:19:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:19:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-07-22 12:19:36,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-07-22 12:19:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-07-22 12:19:36,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-07-22 12:19:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:19:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:19:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:19:36,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:19:36,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:19:36,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:19:36,691 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:19:36,855 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:19:36,860 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:19:37,493 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:19:37,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:19:37,769 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 12:19:37,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:19:37 BoogieIcfgContainer [2022-07-22 12:19:37,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:19:37,774 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:19:37,774 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:19:37,778 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:19:37,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:19:37,779 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:19:36" (1/3) ... [2022-07-22 12:19:37,781 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4eab5658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:19:37, skipping insertion in model container [2022-07-22 12:19:37,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:19:37,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:19:36" (2/3) ... [2022-07-22 12:19:37,781 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4eab5658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:19:37, skipping insertion in model container [2022-07-22 12:19:37,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:19:37,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:19:37" (3/3) ... [2022-07-22 12:19:37,783 INFO L322 chiAutomizerObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2022-07-22 12:19:37,971 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-07-22 12:19:38,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 250 places, 255 transitions, 582 flow [2022-07-22 12:19:38,175 INFO L129 PetriNetUnfolder]: 18/221 cut-off events. [2022-07-22 12:19:38,175 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-22 12:19:38,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 221 events. 18/221 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 281 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-07-22 12:19:38,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 255 transitions, 582 flow [2022-07-22 12:19:38,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 221 transitions, 490 flow [2022-07-22 12:19:38,210 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:19:38,229 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 221 transitions, 490 flow [2022-07-22 12:19:38,237 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 221 transitions, 490 flow [2022-07-22 12:19:38,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 222 places, 221 transitions, 490 flow [2022-07-22 12:19:38,322 INFO L129 PetriNetUnfolder]: 18/221 cut-off events. [2022-07-22 12:19:38,322 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-22 12:19:38,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 221 events. 18/221 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 279 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-07-22 12:19:38,335 INFO L116 LiptonReduction]: Number of co-enabled transitions 7312 [2022-07-22 12:19:43,942 INFO L131 LiptonReduction]: Checked pairs total: 29777 [2022-07-22 12:19:43,942 INFO L133 LiptonReduction]: Total number of compositions: 179 [2022-07-22 12:19:43,976 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:19:43,976 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:19:43,977 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:19:43,977 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:19:43,977 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:19:43,978 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:19:43,978 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:19:43,978 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:19:43,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:19:44,878 INFO L131 ngComponentsAnalysis]: Automaton has 1405 accepting balls. 4261 [2022-07-22 12:19:44,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:19:44,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:19:44,886 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:19:44,886 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:19:44,887 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:19:44,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 5100 states, but on-demand construction may add more states [2022-07-22 12:19:45,016 INFO L131 ngComponentsAnalysis]: Automaton has 1405 accepting balls. 4261 [2022-07-22 12:19:45,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:19:45,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:19:45,017 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:19:45,018 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:19:45,024 INFO L748 eck$LassoCheckResult]: Stem: 253#[ULTIMATE.startENTRY]don't care [1254] ULTIMATE.startENTRY-->L184-6: Formula: (let ((.cse1 (store |v_#valid_747| |v_ULTIMATE.start_main_~#t1~0#1.base_65| 1))) (let ((.cse2 (select |v_#memory_int_421| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_91| 1))) (and (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_91|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_103| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= (select .cse2 0) 48) (= (+ v_~n_1~0_233 1) |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|) (= v_~X_0~0.base_153 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_103| 0)) (not (= (ite (< v_~n_1~0_233 2147483647) 1 0) 0)) (= v_~X_0~0.offset_153 0) (= |v_#NULL.base_12| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_52| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (< |v_#StackHeapBarrier_137| |v_ULTIMATE.start_main_~#t4~0#1.base_91|) (= (store (store (store |v_#length_522| |v_ULTIMATE.start_main_~#t1~0#1.base_65| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_91| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|)) |v_#length_520|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|) 1 0) 0)) (= (select |v_#valid_747| 0) 0) (= (select |v_#valid_747| 1) 1) (= (select |v_#valid_747| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (< 0 |v_#StackHeapBarrier_137|) (= (select |v_#valid_747| |v_ULTIMATE.start_main_~#t1~0#1.base_65|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_39| 0) (= 34 (select |v_#length_522| 2)) (= (select .cse2 1) 0) (= 2 (select |v_#length_522| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| |v_#StackHeapBarrier_137|) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_81|) (< |v_#StackHeapBarrier_137| |v_ULTIMATE.start_main_~#t1~0#1.base_65|) (= |v_#NULL.offset_12| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| 1) |v_#valid_745|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_137|, #valid=|v_#valid_747|, #memory_int=|v_#memory_int_421|, #length=|v_#length_522|} OutVars{~s_6~0=v_~s_6~0_107, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_39|, ~t_9~0=v_~t_9~0_91, ~s_2~0=v_~s_2~0_109, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_31|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_36|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base_37|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_48|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_42|, #length=|v_#length_520|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_42|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_52|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #StackHeapBarrier=|v_#StackHeapBarrier_137|, ~n_1~0=v_~n_1~0_233, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_38|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_38|, ~X_0~0.offset=v_~X_0~0.offset_153, ~t_5~0=v_~t_5~0_67, ULTIMATE.start_create_fresh_int_array_#t~post46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post46#1_23|, ~i_3~0=v_~i_3~0_214, ULTIMATE.start_main_#t~ret38#1.offset=|v_ULTIMATE.start_main_#t~ret38#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_48|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_24|, ~t_4~0=v_~t_4~0_61, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_103|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_42|, ~t_8~0=v_~t_8~0_79, ~i_7~0=v_~i_7~0_246, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_40|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~pre41#1=|v_ULTIMATE.start_main_#t~pre41#1_63|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_65|, ~X_0~0.base=v_~X_0~0.base_153, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_25|, #NULL.base=|v_#NULL.base_12|, #valid=|v_#valid_745|, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_40|, #memory_int=|v_#memory_int_421|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_81|, ULTIMATE.start_main_#t~ret38#1.base=|v_ULTIMATE.start_main_#t~ret38#1.base_29|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|} AuxVars[] AssignedVars[~s_6~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~t_9~0, ~s_2~0, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base, ULTIMATE.start_main_#t~mem44#1, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~n_1~0, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~nondet32#1, ~X_0~0.offset, ~t_5~0, ULTIMATE.start_create_fresh_int_array_#t~post46#1, ~i_3~0, ULTIMATE.start_main_#t~ret38#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1, ~t_4~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, ~t_8~0, ~i_7~0, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre41#1, ULTIMATE.start_main_~#t1~0#1.base, ~X_0~0.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, #valid, ULTIMATE.start_main_#t~nondet37#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~ret38#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 256#[L184-6]don't care [2022-07-22 12:19:45,025 INFO L750 eck$LassoCheckResult]: Loop: 256#[L184-6]don't care [1207] L184-6-->L184-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4) (select |v_#length_354| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|)) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_26|) (= (store |v_#memory_int_292| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_292| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_13|)) |v_#memory_int_291|) (= (select |v_#valid_463| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| |v_ULTIMATE.start_create_fresh_int_array_~size#1_26|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_13|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27|, #valid=|v_#valid_463|, #memory_int=|v_#memory_int_292|, #length=|v_#length_354|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_26|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post46#1_13|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_26|, #valid=|v_#valid_463|, #memory_int=|v_#memory_int_291|, #length=|v_#length_354|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_26|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post46#1, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int] 256#[L184-6]don't care [2022-07-22 12:19:45,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1285, now seen corresponding path program 1 times [2022-07-22 12:19:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:45,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946710555] [2022-07-22 12:19:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:45,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:45,252 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:45,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:45,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1238, now seen corresponding path program 1 times [2022-07-22 12:19:45,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:45,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137990278] [2022-07-22 12:19:45,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:45,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:45,344 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:45,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:45,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash 41042, now seen corresponding path program 1 times [2022-07-22 12:19:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:45,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431427268] [2022-07-22 12:19:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:45,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:45,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:45,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:45,894 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:19:45,895 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:19:45,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:19:45,896 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:19:45,896 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:19:45,896 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:45,896 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:19:45,896 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:19:45,896 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-parallel-sum-1-dsl.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:19:45,897 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:19:45,897 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:19:45,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:19:45,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,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:19:45,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:19:45,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,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:19:45,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,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:19:45,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:19:45,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:19:45,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:19:45,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:19:45,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,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:19:45,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:19:45,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:45,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:46,835 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:19:46,842 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:19:46,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:46,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:46,846 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:19:46,856 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:19:46,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:46,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:46,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:46,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:46,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:46,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:46,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:46,871 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:19:46,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:46,917 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:19:46,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:46,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:46,919 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:19:46,924 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:19:46,925 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:19:46,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:46,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:46,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:46,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:46,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:46,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:46,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:46,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:46,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:46,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:46,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:46,971 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:19:46,972 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:19:46,973 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:19:46,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:46,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:46,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:46,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:46,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:46,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:47,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,042 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:19:47,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,044 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:19:47,054 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:19:47,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,065 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:19:47,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,108 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:19:47,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,110 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:19:47,114 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:19:47,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:47,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:47,130 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:19:47,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,174 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:19:47,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,176 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:19:47,178 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:19:47,178 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:19:47,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:47,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:47,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:47,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,238 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:19:47,246 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:19:47,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:47,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:47,261 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:19:47,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,309 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:19:47,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,311 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:19:47,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:19:47,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,326 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:19:47,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,367 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:19:47,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,369 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:19:47,371 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:19:47,372 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:19:47,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:47,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,404 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:19:47,409 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:19:47,409 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:19:47,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:47,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:47,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,478 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:19:47,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,480 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:19:47,482 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:19:47,483 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:19:47,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,541 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:19:47,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,542 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:19:47,547 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:19:47,548 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:19:47,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:47,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:47,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:47,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,597 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:19:47,598 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:19:47,598 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:19:47,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,628 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:19:47,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,630 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:19:47,634 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:19:47,635 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:19:47,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,676 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:19:47,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,679 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:19:47,680 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:19:47,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:19:47,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,716 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:19:47,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,721 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:19:47,723 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:19:47,724 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:19:47,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,755 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:19:47,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,757 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:19:47,759 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:19:47,759 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:19:47,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:47,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:47,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,802 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:19:47,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,803 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:19:47,804 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:19:47,807 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:19:47,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,843 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:19:47,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,845 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:19:47,847 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:19:47,848 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:19:47,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,883 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:19:47,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,884 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:19:47,885 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:19:47,885 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:19:47,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,920 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,953 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:19:47,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:47,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:47,955 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:19:47,957 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:19:47,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:47,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:47,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:47,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:47,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:47,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:47,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:47,968 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:19:47,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:47,999 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:19:48,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,001 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:19:48,002 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:19:48,002 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:19:48,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:48,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:48,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,035 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:19:48,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,036 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:19:48,037 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:19:48,038 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:19:48,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:48,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:48,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:48,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,076 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:19:48,077 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:19:48,078 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:19:48,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:48,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:48,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:48,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,114 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:19:48,115 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:19:48,116 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:19:48,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:48,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:48,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:48,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,147 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:19:48,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,149 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:19:48,150 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:19:48,151 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:19:48,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:48,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:48,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:48,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:48,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,183 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:19:48,184 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:19:48,184 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:19:48,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:48,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:48,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:48,214 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:48,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,246 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:19:48,248 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:19:48,249 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:19:48,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:48,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:48,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:48,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,294 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:19:48,295 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:19:48,297 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:19:48,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:48,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:48,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-22 12:19:48,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,359 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:19:48,364 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:19:48,365 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:19:48,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:48,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:48,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:48,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:19:48,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,408 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:19:48,414 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:19:48,416 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:19:48,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:48,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:48,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,473 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:19:48,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,474 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:19:48,481 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:19:48,485 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:19:48,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:48,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:48,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:48,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-22 12:19:48,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,531 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:19:48,531 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:19:48,532 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:19:48,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:48,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:48,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:48,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,565 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:19:48,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,567 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:19:48,569 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:19:48,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:48,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:48,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:48,581 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:19:48,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-22 12:19:48,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,612 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:19:48,613 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:19:48,614 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:19:48,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:48,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:48,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:48,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,650 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:19:48,652 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:19:48,652 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:19:48,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:48,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:48,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-22 12:19:48,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,709 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:19:48,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 12:19:48,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:19:48,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:48,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:48,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:48,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,769 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:19:48,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 12:19:48,771 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:19:48,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:48,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:48,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-22 12:19:48,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,812 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:19:48,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 12:19:48,814 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:19:48,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:19:48,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:19:48,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:19:48,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:19:48,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:48,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,857 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:19:48,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 12:19:48,859 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:19:48,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:19:48,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:19:48,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:19:48,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:19:48,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:19:48,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:19:48,885 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:19:48,922 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-07-22 12:19:48,923 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-07-22 12:19:48,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:48,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:48,927 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:19:48,928 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:19:48,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 12:19:48,945 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:19:48,946 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:19:48,946 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:19:48,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:49,073 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:19:49,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:19:49,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:19:49,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:19:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:19:49,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:19:49,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:19:49,147 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:19:49,200 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:19:49,203 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 5100 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:19:49,366 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 5100 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 5102 states and 23105 transitions. Complement of second has 3 states. [2022-07-22 12:19:49,369 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:19:49,376 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:19:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:19:49,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:19:49,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:19:49,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:19:49,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:19:49,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:19:49,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:19:49,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5102 states and 23105 transitions. [2022-07-22 12:19:49,486 INFO L131 ngComponentsAnalysis]: Automaton has 1404 accepting balls. 4260 [2022-07-22 12:19:49,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5102 states to 4920 states and 22358 transitions. [2022-07-22 12:19:49,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4918 [2022-07-22 12:19:49,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4919 [2022-07-22 12:19:49,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4920 states and 22358 transitions. [2022-07-22 12:19:49,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:49,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:19:49,867 INFO L220 hiAutomatonCegarLoop]: Abstraction has 4920 states and 22358 transitions. [2022-07-22 12:19:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states and 22358 transitions. [2022-07-22 12:19:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 4920. [2022-07-22 12:19:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4920 states, 4920 states have (on average 4.544308943089431) internal successors, (22358), 4919 states have internal predecessors, (22358), 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:19:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4920 states to 4920 states and 22358 transitions. [2022-07-22 12:19:50,270 INFO L242 hiAutomatonCegarLoop]: Abstraction has 4920 states and 22358 transitions. [2022-07-22 12:19:50,270 INFO L425 stractBuchiCegarLoop]: Abstraction has 4920 states and 22358 transitions. [2022-07-22 12:19:50,272 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:19:50,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4920 states and 22358 transitions. [2022-07-22 12:19:50,344 INFO L131 ngComponentsAnalysis]: Automaton has 1404 accepting balls. 4260 [2022-07-22 12:19:50,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:19:50,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:19:50,346 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:19:50,346 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:19:50,347 INFO L748 eck$LassoCheckResult]: Stem: 25396#[ULTIMATE.startENTRY]don't care [1254] ULTIMATE.startENTRY-->L184-6: Formula: (let ((.cse1 (store |v_#valid_747| |v_ULTIMATE.start_main_~#t1~0#1.base_65| 1))) (let ((.cse2 (select |v_#memory_int_421| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_91| 1))) (and (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_91|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_103| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= (select .cse2 0) 48) (= (+ v_~n_1~0_233 1) |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|) (= v_~X_0~0.base_153 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_103| 0)) (not (= (ite (< v_~n_1~0_233 2147483647) 1 0) 0)) (= v_~X_0~0.offset_153 0) (= |v_#NULL.base_12| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_52| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (< |v_#StackHeapBarrier_137| |v_ULTIMATE.start_main_~#t4~0#1.base_91|) (= (store (store (store |v_#length_522| |v_ULTIMATE.start_main_~#t1~0#1.base_65| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_91| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|)) |v_#length_520|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|) 1 0) 0)) (= (select |v_#valid_747| 0) 0) (= (select |v_#valid_747| 1) 1) (= (select |v_#valid_747| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (< 0 |v_#StackHeapBarrier_137|) (= (select |v_#valid_747| |v_ULTIMATE.start_main_~#t1~0#1.base_65|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_39| 0) (= 34 (select |v_#length_522| 2)) (= (select .cse2 1) 0) (= 2 (select |v_#length_522| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| |v_#StackHeapBarrier_137|) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_81|) (< |v_#StackHeapBarrier_137| |v_ULTIMATE.start_main_~#t1~0#1.base_65|) (= |v_#NULL.offset_12| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| 1) |v_#valid_745|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_137|, #valid=|v_#valid_747|, #memory_int=|v_#memory_int_421|, #length=|v_#length_522|} OutVars{~s_6~0=v_~s_6~0_107, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_39|, ~t_9~0=v_~t_9~0_91, ~s_2~0=v_~s_2~0_109, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_31|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_36|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base_37|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_48|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_42|, #length=|v_#length_520|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_42|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_52|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #StackHeapBarrier=|v_#StackHeapBarrier_137|, ~n_1~0=v_~n_1~0_233, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_38|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_38|, ~X_0~0.offset=v_~X_0~0.offset_153, ~t_5~0=v_~t_5~0_67, ULTIMATE.start_create_fresh_int_array_#t~post46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post46#1_23|, ~i_3~0=v_~i_3~0_214, ULTIMATE.start_main_#t~ret38#1.offset=|v_ULTIMATE.start_main_#t~ret38#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_48|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_24|, ~t_4~0=v_~t_4~0_61, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_103|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_42|, ~t_8~0=v_~t_8~0_79, ~i_7~0=v_~i_7~0_246, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_40|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~pre41#1=|v_ULTIMATE.start_main_#t~pre41#1_63|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_65|, ~X_0~0.base=v_~X_0~0.base_153, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_25|, #NULL.base=|v_#NULL.base_12|, #valid=|v_#valid_745|, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_40|, #memory_int=|v_#memory_int_421|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_81|, ULTIMATE.start_main_#t~ret38#1.base=|v_ULTIMATE.start_main_#t~ret38#1.base_29|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|} AuxVars[] AssignedVars[~s_6~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~t_9~0, ~s_2~0, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base, ULTIMATE.start_main_#t~mem44#1, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~n_1~0, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~nondet32#1, ~X_0~0.offset, ~t_5~0, ULTIMATE.start_create_fresh_int_array_#t~post46#1, ~i_3~0, ULTIMATE.start_main_#t~ret38#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1, ~t_4~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, ~t_8~0, ~i_7~0, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre41#1, ULTIMATE.start_main_~#t1~0#1.base, ~X_0~0.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, #valid, ULTIMATE.start_main_#t~nondet37#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~ret38#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 23602#[L184-6]don't care [1235] L184-6-->L168-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_43|) (select |v_#length_496| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_ULTIMATE.start_main_#t~pre39#1_25| |v_#pthreadsForks_130|) (= |v_#memory_int_413| (store |v_#memory_int_414| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_414| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) |v_ULTIMATE.start_main_~#t1~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre39#1_25|))) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| v_~X_0~0.base_147) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_43|) (= 1 (select |v_#valid_711| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| v_~X_0~0.offset_147) (= |v_#pthreadsForks_129| (+ |v_#pthreadsForks_130| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_130|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_711|, #memory_int=|v_#memory_int_414|, #length=|v_#length_496|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~ret38#1.offset=|v_ULTIMATE.start_main_#t~ret38#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_25|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~X_0~0.base=v_~X_0~0.base_147, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16|, #pthreadsForks=|v_#pthreadsForks_129|, #valid=|v_#valid_711|, #memory_int=|v_#memory_int_413|, #length=|v_#length_496|, ~X_0~0.offset=v_~X_0~0.offset_147, ULTIMATE.start_main_#t~ret38#1.base=|v_ULTIMATE.start_main_#t~ret38#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret38#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre39#1, #memory_int, ~X_0~0.offset, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret38#1.base] 23604#[L168-3]don't care [1045] L168-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork5_thidvar2_2 0) (= v_thread1Thread1of1ForFork5_thidvar0_2 |v_ULTIMATE.start_main_#t~pre39#1_6|) (= v_thread1Thread1of1ForFork5_thidvar1_2 0) (= v_thread1Thread1of1ForFork5_thidvar4_2 0) (= v_thread1Thread1of1ForFork5_thidvar5_2 0) (= v_thread1Thread1of1ForFork5_thidvar3_2 0)) InVars {ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|} OutVars{thread1Thread1of1ForFork5_#t~nondet10=|v_thread1Thread1of1ForFork5_#t~nondet10_4|, thread1Thread1of1ForFork5_#t~nondet12=|v_thread1Thread1of1ForFork5_#t~nondet12_4|, thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_8|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_10|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_12|, thread1Thread1of1ForFork5_thidvar5=v_thread1Thread1of1ForFork5_thidvar5_2, thread1Thread1of1ForFork5_thidvar4=v_thread1Thread1of1ForFork5_thidvar4_2, thread1Thread1of1ForFork5_thidvar3=v_thread1Thread1of1ForFork5_thidvar3_2, thread1Thread1of1ForFork5_thidvar2=v_thread1Thread1of1ForFork5_thidvar2_2, thread1Thread1of1ForFork5_thidvar1=v_thread1Thread1of1ForFork5_thidvar1_2, thread1Thread1of1ForFork5_#res.offset=|v_thread1Thread1of1ForFork5_#res.offset_4|, thread1Thread1of1ForFork5_~#t3~0.offset=|v_thread1Thread1of1ForFork5_~#t3~0.offset_10|, thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2, thread1Thread1of1ForFork5_~#t3~0.base=|v_thread1Thread1of1ForFork5_~#t3~0.base_12|, thread1Thread1of1ForFork5_#t~pre11=|v_thread1Thread1of1ForFork5_#t~pre11_8|, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_6|, thread1Thread1of1ForFork5_#t~mem14=|v_thread1Thread1of1ForFork5_#t~mem14_6|, thread1Thread1of1ForFork5_#res.base=|v_thread1Thread1of1ForFork5_#res.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_#t~nondet10, thread1Thread1of1ForFork5_#t~nondet12, thread1Thread1of1ForFork5_#t~pre9, thread1Thread1of1ForFork5_~#t2~0.offset, thread1Thread1of1ForFork5_~#t2~0.base, thread1Thread1of1ForFork5_thidvar5, thread1Thread1of1ForFork5_thidvar4, thread1Thread1of1ForFork5_thidvar3, thread1Thread1of1ForFork5_thidvar2, thread1Thread1of1ForFork5_thidvar1, thread1Thread1of1ForFork5_#res.offset, thread1Thread1of1ForFork5_~#t3~0.offset, thread1Thread1of1ForFork5_thidvar0, thread1Thread1of1ForFork5_~#t3~0.base, thread1Thread1of1ForFork5_#t~pre11, thread1Thread1of1ForFork5_#t~mem13, thread1Thread1of1ForFork5_#t~mem14, thread1Thread1of1ForFork5_#res.base] 23976#[L168-4, thread1ENTRY]don't care [934] thread1ENTRY-->L84: Formula: (and (= (store |v_#length_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_1| 4) |v_#length_1|) (= |v_thread1Thread1of1ForFork5_~#t2~0.offset_1| 0) (not (= |v_thread1Thread1of1ForFork5_~#t2~0.base_1| 0)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_1|) 0) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork5_~#t2~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_1|, #valid=|v_#valid_1|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_~#t2~0.offset, #valid, #length, thread1Thread1of1ForFork5_~#t2~0.base] 24114#[L84, L168-4]don't care [1094] L84-->L89: Formula: (and (= (store |v_#valid_124| |v_thread1Thread1of1ForFork5_~#t3~0.base_15| 1) |v_#valid_123|) (= (select |v_#valid_124| |v_thread1Thread1of1ForFork5_~#t3~0.base_15|) 0) (= v_~i_3~0_100 0) (not (= |v_thread1Thread1of1ForFork5_~#t3~0.base_15| 0)) (< |v_#StackHeapBarrier_19| |v_thread1Thread1of1ForFork5_~#t3~0.base_15|) (= (store |v_#length_101| |v_thread1Thread1of1ForFork5_~#t3~0.base_15| 4) |v_#length_100|) (= v_~s_2~0_49 0) (= |v_thread1Thread1of1ForFork5_~#t3~0.offset_13| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_124|, #length=|v_#length_101|} OutVars{~i_3~0=v_~i_3~0_100, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~s_2~0=v_~s_2~0_49, thread1Thread1of1ForFork5_~#t3~0.offset=|v_thread1Thread1of1ForFork5_~#t3~0.offset_13|, thread1Thread1of1ForFork5_~#t3~0.base=|v_thread1Thread1of1ForFork5_~#t3~0.base_15|, #valid=|v_#valid_123|, #length=|v_#length_100|} AuxVars[] AssignedVars[~i_3~0, ~s_2~0, thread1Thread1of1ForFork5_~#t3~0.offset, thread1Thread1of1ForFork5_~#t3~0.base, #valid, #length] 23700#[L168-4, L89]don't care [937] L89-->L91: Formula: (= |v_thread1Thread1of1ForFork5_#t~pre9_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_#t~pre9] 21856#[L91, L168-4]don't care [938] L91-->L91-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 21860#[L91-1, L168-4]don't care [939] L91-1-->L91-2: Formula: (and (<= (+ |v_thread1Thread1of1ForFork5_~#t2~0.offset_3| 4) (select |v_#length_5| |v_thread1Thread1of1ForFork5_~#t2~0.base_3|)) (= (select |v_#valid_5| |v_thread1Thread1of1ForFork5_~#t2~0.base_3|) 1) (<= 0 |v_thread1Thread1of1ForFork5_~#t2~0.offset_3|) (= (store |v_#memory_int_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_3| (store (select |v_#memory_int_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_3|) |v_thread1Thread1of1ForFork5_~#t2~0.offset_3| |v_thread1Thread1of1ForFork5_#t~pre9_3|)) |v_#memory_int_1|)) InVars {thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_3|, #valid=|v_#valid_5|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_3|} OutVars{thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_3|, #valid=|v_#valid_5|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_3|} AuxVars[] AssignedVars[#memory_int] 25074#[L168-4, L91-2]don't care [1048] L91-2-->L56: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar1_4) (= |v_thread1Thread1of1ForFork5_#t~pre9_10| v_thread2Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_10|} OutVars{thread2Thread1of1ForFork2_#t~nondet1#1=|v_thread2Thread1of1ForFork2_#t~nondet1#1_12|, thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_10|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_6|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_6|, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_6|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_6|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_6|, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_#t~ret4#1=|v_thread2Thread1of1ForFork2_#t~ret4#1_6|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_10|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_6|, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_6|, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~nondet1#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~post2#1, thread2Thread1of1ForFork2_plus_#in~a#1] 24464#[L56, L168-4, L91-3]don't care [2022-07-22 12:19:50,351 INFO L750 eck$LassoCheckResult]: Loop: 24464#[L56, L168-4, L91-3]don't care [1204] L56-->L53: Formula: (let ((.cse0 (* v_~i_3~0_150 4))) (let ((.cse1 (+ .cse0 v_~X_0~0.offset_99))) (and (<= (+ .cse0 v_~X_0~0.offset_99 4) (select |v_#length_350| v_~X_0~0.base_99)) (= (select |v_#valid_459| v_~X_0~0.base_99) 1) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_29| 0)) (= (select (select |v_#memory_int_285| v_~X_0~0.base_99) .cse1) v_~t_4~0_39) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29| (ite (< v_~i_3~0_151 v_~n_1~0_159) 1 0)) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet1#1_22| 256) 0)) (= v_~i_3~0_150 (+ v_~i_3~0_151 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_29|) (<= 0 .cse1)))) InVars {~i_3~0=v_~i_3~0_151, thread2Thread1of1ForFork2_#t~nondet1#1=|v_thread2Thread1of1ForFork2_#t~nondet1#1_22|, ~n_1~0=v_~n_1~0_159, #valid=|v_#valid_459|, #memory_int=|v_#memory_int_285|, ~X_0~0.offset=v_~X_0~0.offset_99, #length=|v_#length_350|, ~X_0~0.base=v_~X_0~0.base_99} OutVars{~i_3~0=v_~i_3~0_150, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_13|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29|, ~X_0~0.base=v_~X_0~0.base_99, ~t_4~0=v_~t_4~0_39, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_29|, ~n_1~0=v_~n_1~0_159, #valid=|v_#valid_459|, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_13|, #memory_int=|v_#memory_int_285|, ~X_0~0.offset=v_~X_0~0.offset_99, #length=|v_#length_350|} AuxVars[] AssignedVars[~i_3~0, thread2Thread1of1ForFork2_#t~nondet1#1, ~t_4~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem3#1, thread2Thread1of1ForFork2_#t~post2#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] 24466#[L168-4, L53, L91-3]don't care [970] L53-->L56: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1|))) (and (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_1| |v_thread2Thread1of1ForFork2_plus_~a#1_1|) (= v_~s_2~0_40 |v_thread2Thread1of1ForFork2_plus_#in~a#1_1|) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_1| v_~t_4~0_19) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse0) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| v_~s_2~0_39) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork2_plus_~b#1_1|)) 1 0) 0)))) InVars {~s_2~0=v_~s_2~0_40, ~t_4~0=v_~t_4~0_19} OutVars{~t_4~0=v_~t_4~0_19, thread2Thread1of1ForFork2_#t~ret4#1=|v_thread2Thread1of1ForFork2_#t~ret4#1_1|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, ~s_2~0=v_~s_2~0_39, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, ~s_2~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_plus_#in~a#1] 24464#[L56, L168-4, L91-3]don't care [2022-07-22 12:19:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash -967085003, now seen corresponding path program 1 times [2022-07-22 12:19:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:50,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635790443] [2022-07-22 12:19:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:50,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:50,512 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:50,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:50,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:50,553 INFO L85 PathProgramCache]: Analyzing trace with hash 39255, now seen corresponding path program 1 times [2022-07-22 12:19:50,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:50,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38915310] [2022-07-22 12:19:50,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:50,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:50,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:50,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:50,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:50,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1655713653, now seen corresponding path program 1 times [2022-07-22 12:19:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:50,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402716119] [2022-07-22 12:19:50,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:50,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:19:50,746 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:19:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:19:50,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402716119] [2022-07-22 12:19:50,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402716119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:19:50,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:19:50,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 12:19:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590295954] [2022-07-22 12:19:50,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:19:51,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:19:51,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:19:51,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:19:51,012 INFO L87 Difference]: Start difference. First operand 4920 states and 22358 transitions. cyclomatic complexity: 18843 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:19:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:19:51,528 INFO L93 Difference]: Finished difference Result 6981 states and 28994 transitions. [2022-07-22 12:19:51,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6981 states and 28994 transitions. [2022-07-22 12:19:51,651 INFO L131 ngComponentsAnalysis]: Automaton has 1404 accepting balls. 4260 [2022-07-22 12:19:51,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6981 states to 4920 states and 22357 transitions. [2022-07-22 12:19:51,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4919 [2022-07-22 12:19:51,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4919 [2022-07-22 12:19:51,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4920 states and 22357 transitions. [2022-07-22 12:19:51,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:19:51,866 INFO L220 hiAutomatonCegarLoop]: Abstraction has 4920 states and 22357 transitions. [2022-07-22 12:19:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states and 22357 transitions. [2022-07-22 12:19:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 4920. [2022-07-22 12:19:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4920 states, 4920 states have (on average 4.54410569105691) internal successors, (22357), 4919 states have internal predecessors, (22357), 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:19:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4920 states to 4920 states and 22357 transitions. [2022-07-22 12:19:52,206 INFO L242 hiAutomatonCegarLoop]: Abstraction has 4920 states and 22357 transitions. [2022-07-22 12:19:52,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:19:52,207 INFO L425 stractBuchiCegarLoop]: Abstraction has 4920 states and 22357 transitions. [2022-07-22 12:19:52,207 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:19:52,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4920 states and 22357 transitions. [2022-07-22 12:19:52,265 INFO L131 ngComponentsAnalysis]: Automaton has 1404 accepting balls. 4260 [2022-07-22 12:19:52,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:19:52,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:19:52,267 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:19:52,267 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:19:52,269 INFO L748 eck$LassoCheckResult]: Stem: 42231#[ULTIMATE.startENTRY]don't care [1254] ULTIMATE.startENTRY-->L184-6: Formula: (let ((.cse1 (store |v_#valid_747| |v_ULTIMATE.start_main_~#t1~0#1.base_65| 1))) (let ((.cse2 (select |v_#memory_int_421| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_91| 1))) (and (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_91|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_103| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= (select .cse2 0) 48) (= (+ v_~n_1~0_233 1) |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|) (= v_~X_0~0.base_153 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_103| 0)) (not (= (ite (< v_~n_1~0_233 2147483647) 1 0) 0)) (= v_~X_0~0.offset_153 0) (= |v_#NULL.base_12| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_52| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (< |v_#StackHeapBarrier_137| |v_ULTIMATE.start_main_~#t4~0#1.base_91|) (= (store (store (store |v_#length_522| |v_ULTIMATE.start_main_~#t1~0#1.base_65| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_91| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|)) |v_#length_520|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|) 1 0) 0)) (= (select |v_#valid_747| 0) 0) (= (select |v_#valid_747| 1) 1) (= (select |v_#valid_747| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (< 0 |v_#StackHeapBarrier_137|) (= (select |v_#valid_747| |v_ULTIMATE.start_main_~#t1~0#1.base_65|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_39| 0) (= 34 (select |v_#length_522| 2)) (= (select .cse2 1) 0) (= 2 (select |v_#length_522| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| |v_#StackHeapBarrier_137|) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_81|) (< |v_#StackHeapBarrier_137| |v_ULTIMATE.start_main_~#t1~0#1.base_65|) (= |v_#NULL.offset_12| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| 1) |v_#valid_745|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_137|, #valid=|v_#valid_747|, #memory_int=|v_#memory_int_421|, #length=|v_#length_522|} OutVars{~s_6~0=v_~s_6~0_107, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_39|, ~t_9~0=v_~t_9~0_91, ~s_2~0=v_~s_2~0_109, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_31|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_36|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base_37|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_48|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_42|, #length=|v_#length_520|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_42|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_52|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #StackHeapBarrier=|v_#StackHeapBarrier_137|, ~n_1~0=v_~n_1~0_233, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_38|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_38|, ~X_0~0.offset=v_~X_0~0.offset_153, ~t_5~0=v_~t_5~0_67, ULTIMATE.start_create_fresh_int_array_#t~post46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post46#1_23|, ~i_3~0=v_~i_3~0_214, ULTIMATE.start_main_#t~ret38#1.offset=|v_ULTIMATE.start_main_#t~ret38#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_48|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_24|, ~t_4~0=v_~t_4~0_61, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_103|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_42|, ~t_8~0=v_~t_8~0_79, ~i_7~0=v_~i_7~0_246, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_40|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~pre41#1=|v_ULTIMATE.start_main_#t~pre41#1_63|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_65|, ~X_0~0.base=v_~X_0~0.base_153, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_25|, #NULL.base=|v_#NULL.base_12|, #valid=|v_#valid_745|, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_40|, #memory_int=|v_#memory_int_421|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_81|, ULTIMATE.start_main_#t~ret38#1.base=|v_ULTIMATE.start_main_#t~ret38#1.base_29|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|} AuxVars[] AssignedVars[~s_6~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~t_9~0, ~s_2~0, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base, ULTIMATE.start_main_#t~mem44#1, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~n_1~0, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~nondet32#1, ~X_0~0.offset, ~t_5~0, ULTIMATE.start_create_fresh_int_array_#t~post46#1, ~i_3~0, ULTIMATE.start_main_#t~ret38#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1, ~t_4~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, ~t_8~0, ~i_7~0, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre41#1, ULTIMATE.start_main_~#t1~0#1.base, ~X_0~0.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, #valid, ULTIMATE.start_main_#t~nondet37#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~ret38#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 40437#[L184-6]don't care [1207] L184-6-->L184-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4) (select |v_#length_354| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|)) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_26|) (= (store |v_#memory_int_292| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_292| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_13|)) |v_#memory_int_291|) (= (select |v_#valid_463| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| |v_ULTIMATE.start_create_fresh_int_array_~size#1_26|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_13|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27|, #valid=|v_#valid_463|, #memory_int=|v_#memory_int_292|, #length=|v_#length_354|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_26|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post46#1_13|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_26|, #valid=|v_#valid_463|, #memory_int=|v_#memory_int_291|, #length=|v_#length_354|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_26|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post46#1, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int] 40439#[L184-6]don't care [1235] L184-6-->L168-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_43|) (select |v_#length_496| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_ULTIMATE.start_main_#t~pre39#1_25| |v_#pthreadsForks_130|) (= |v_#memory_int_413| (store |v_#memory_int_414| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_414| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) |v_ULTIMATE.start_main_~#t1~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre39#1_25|))) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| v_~X_0~0.base_147) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_43|) (= 1 (select |v_#valid_711| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| v_~X_0~0.offset_147) (= |v_#pthreadsForks_129| (+ |v_#pthreadsForks_130| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_130|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_711|, #memory_int=|v_#memory_int_414|, #length=|v_#length_496|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~ret38#1.offset=|v_ULTIMATE.start_main_#t~ret38#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_25|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~X_0~0.base=v_~X_0~0.base_147, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16|, #pthreadsForks=|v_#pthreadsForks_129|, #valid=|v_#valid_711|, #memory_int=|v_#memory_int_413|, #length=|v_#length_496|, ~X_0~0.offset=v_~X_0~0.offset_147, ULTIMATE.start_main_#t~ret38#1.base=|v_ULTIMATE.start_main_#t~ret38#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret38#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre39#1, #memory_int, ~X_0~0.offset, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret38#1.base] 40441#[L168-3]don't care [1045] L168-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork5_thidvar2_2 0) (= v_thread1Thread1of1ForFork5_thidvar0_2 |v_ULTIMATE.start_main_#t~pre39#1_6|) (= v_thread1Thread1of1ForFork5_thidvar1_2 0) (= v_thread1Thread1of1ForFork5_thidvar4_2 0) (= v_thread1Thread1of1ForFork5_thidvar5_2 0) (= v_thread1Thread1of1ForFork5_thidvar3_2 0)) InVars {ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|} OutVars{thread1Thread1of1ForFork5_#t~nondet10=|v_thread1Thread1of1ForFork5_#t~nondet10_4|, thread1Thread1of1ForFork5_#t~nondet12=|v_thread1Thread1of1ForFork5_#t~nondet12_4|, thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_8|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_10|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_12|, thread1Thread1of1ForFork5_thidvar5=v_thread1Thread1of1ForFork5_thidvar5_2, thread1Thread1of1ForFork5_thidvar4=v_thread1Thread1of1ForFork5_thidvar4_2, thread1Thread1of1ForFork5_thidvar3=v_thread1Thread1of1ForFork5_thidvar3_2, thread1Thread1of1ForFork5_thidvar2=v_thread1Thread1of1ForFork5_thidvar2_2, thread1Thread1of1ForFork5_thidvar1=v_thread1Thread1of1ForFork5_thidvar1_2, thread1Thread1of1ForFork5_#res.offset=|v_thread1Thread1of1ForFork5_#res.offset_4|, thread1Thread1of1ForFork5_~#t3~0.offset=|v_thread1Thread1of1ForFork5_~#t3~0.offset_10|, thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2, thread1Thread1of1ForFork5_~#t3~0.base=|v_thread1Thread1of1ForFork5_~#t3~0.base_12|, thread1Thread1of1ForFork5_#t~pre11=|v_thread1Thread1of1ForFork5_#t~pre11_8|, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_6|, thread1Thread1of1ForFork5_#t~mem14=|v_thread1Thread1of1ForFork5_#t~mem14_6|, thread1Thread1of1ForFork5_#res.base=|v_thread1Thread1of1ForFork5_#res.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_#t~nondet10, thread1Thread1of1ForFork5_#t~nondet12, thread1Thread1of1ForFork5_#t~pre9, thread1Thread1of1ForFork5_~#t2~0.offset, thread1Thread1of1ForFork5_~#t2~0.base, thread1Thread1of1ForFork5_thidvar5, thread1Thread1of1ForFork5_thidvar4, thread1Thread1of1ForFork5_thidvar3, thread1Thread1of1ForFork5_thidvar2, thread1Thread1of1ForFork5_thidvar1, thread1Thread1of1ForFork5_#res.offset, thread1Thread1of1ForFork5_~#t3~0.offset, thread1Thread1of1ForFork5_thidvar0, thread1Thread1of1ForFork5_~#t3~0.base, thread1Thread1of1ForFork5_#t~pre11, thread1Thread1of1ForFork5_#t~mem13, thread1Thread1of1ForFork5_#t~mem14, thread1Thread1of1ForFork5_#res.base] 40811#[L168-4, thread1ENTRY]don't care [934] thread1ENTRY-->L84: Formula: (and (= (store |v_#length_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_1| 4) |v_#length_1|) (= |v_thread1Thread1of1ForFork5_~#t2~0.offset_1| 0) (not (= |v_thread1Thread1of1ForFork5_~#t2~0.base_1| 0)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_1|) 0) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork5_~#t2~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_1|, #valid=|v_#valid_1|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_~#t2~0.offset, #valid, #length, thread1Thread1of1ForFork5_~#t2~0.base] 40949#[L84, L168-4]don't care [1094] L84-->L89: Formula: (and (= (store |v_#valid_124| |v_thread1Thread1of1ForFork5_~#t3~0.base_15| 1) |v_#valid_123|) (= (select |v_#valid_124| |v_thread1Thread1of1ForFork5_~#t3~0.base_15|) 0) (= v_~i_3~0_100 0) (not (= |v_thread1Thread1of1ForFork5_~#t3~0.base_15| 0)) (< |v_#StackHeapBarrier_19| |v_thread1Thread1of1ForFork5_~#t3~0.base_15|) (= (store |v_#length_101| |v_thread1Thread1of1ForFork5_~#t3~0.base_15| 4) |v_#length_100|) (= v_~s_2~0_49 0) (= |v_thread1Thread1of1ForFork5_~#t3~0.offset_13| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_124|, #length=|v_#length_101|} OutVars{~i_3~0=v_~i_3~0_100, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~s_2~0=v_~s_2~0_49, thread1Thread1of1ForFork5_~#t3~0.offset=|v_thread1Thread1of1ForFork5_~#t3~0.offset_13|, thread1Thread1of1ForFork5_~#t3~0.base=|v_thread1Thread1of1ForFork5_~#t3~0.base_15|, #valid=|v_#valid_123|, #length=|v_#length_100|} AuxVars[] AssignedVars[~i_3~0, ~s_2~0, thread1Thread1of1ForFork5_~#t3~0.offset, thread1Thread1of1ForFork5_~#t3~0.base, #valid, #length] 40535#[L168-4, L89]don't care [937] L89-->L91: Formula: (= |v_thread1Thread1of1ForFork5_#t~pre9_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_#t~pre9] 38691#[L91, L168-4]don't care [938] L91-->L91-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 38695#[L91-1, L168-4]don't care [939] L91-1-->L91-2: Formula: (and (<= (+ |v_thread1Thread1of1ForFork5_~#t2~0.offset_3| 4) (select |v_#length_5| |v_thread1Thread1of1ForFork5_~#t2~0.base_3|)) (= (select |v_#valid_5| |v_thread1Thread1of1ForFork5_~#t2~0.base_3|) 1) (<= 0 |v_thread1Thread1of1ForFork5_~#t2~0.offset_3|) (= (store |v_#memory_int_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_3| (store (select |v_#memory_int_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_3|) |v_thread1Thread1of1ForFork5_~#t2~0.offset_3| |v_thread1Thread1of1ForFork5_#t~pre9_3|)) |v_#memory_int_1|)) InVars {thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_3|, #valid=|v_#valid_5|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_3|} OutVars{thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_3|, #valid=|v_#valid_5|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_3|} AuxVars[] AssignedVars[#memory_int] 41909#[L168-4, L91-2]don't care [1048] L91-2-->L56: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar1_4) (= |v_thread1Thread1of1ForFork5_#t~pre9_10| v_thread2Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_10|} OutVars{thread2Thread1of1ForFork2_#t~nondet1#1=|v_thread2Thread1of1ForFork2_#t~nondet1#1_12|, thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_10|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_6|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_6|, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_6|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_6|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_6|, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_#t~ret4#1=|v_thread2Thread1of1ForFork2_#t~ret4#1_6|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_10|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_6|, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_6|, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~nondet1#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~post2#1, thread2Thread1of1ForFork2_plus_#in~a#1] 41297#[L56, L168-4, L91-3]don't care [2022-07-22 12:19:52,269 INFO L750 eck$LassoCheckResult]: Loop: 41297#[L56, L168-4, L91-3]don't care [1204] L56-->L53: Formula: (let ((.cse0 (* v_~i_3~0_150 4))) (let ((.cse1 (+ .cse0 v_~X_0~0.offset_99))) (and (<= (+ .cse0 v_~X_0~0.offset_99 4) (select |v_#length_350| v_~X_0~0.base_99)) (= (select |v_#valid_459| v_~X_0~0.base_99) 1) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_29| 0)) (= (select (select |v_#memory_int_285| v_~X_0~0.base_99) .cse1) v_~t_4~0_39) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29| (ite (< v_~i_3~0_151 v_~n_1~0_159) 1 0)) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet1#1_22| 256) 0)) (= v_~i_3~0_150 (+ v_~i_3~0_151 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_29|) (<= 0 .cse1)))) InVars {~i_3~0=v_~i_3~0_151, thread2Thread1of1ForFork2_#t~nondet1#1=|v_thread2Thread1of1ForFork2_#t~nondet1#1_22|, ~n_1~0=v_~n_1~0_159, #valid=|v_#valid_459|, #memory_int=|v_#memory_int_285|, ~X_0~0.offset=v_~X_0~0.offset_99, #length=|v_#length_350|, ~X_0~0.base=v_~X_0~0.base_99} OutVars{~i_3~0=v_~i_3~0_150, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_13|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29|, ~X_0~0.base=v_~X_0~0.base_99, ~t_4~0=v_~t_4~0_39, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_29|, ~n_1~0=v_~n_1~0_159, #valid=|v_#valid_459|, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_13|, #memory_int=|v_#memory_int_285|, ~X_0~0.offset=v_~X_0~0.offset_99, #length=|v_#length_350|} AuxVars[] AssignedVars[~i_3~0, thread2Thread1of1ForFork2_#t~nondet1#1, ~t_4~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem3#1, thread2Thread1of1ForFork2_#t~post2#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] 41299#[L168-4, L53, L91-3]don't care [970] L53-->L56: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1|))) (and (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_1| |v_thread2Thread1of1ForFork2_plus_~a#1_1|) (= v_~s_2~0_40 |v_thread2Thread1of1ForFork2_plus_#in~a#1_1|) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_1| v_~t_4~0_19) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse0) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| v_~s_2~0_39) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork2_plus_~b#1_1|)) 1 0) 0)))) InVars {~s_2~0=v_~s_2~0_40, ~t_4~0=v_~t_4~0_19} OutVars{~t_4~0=v_~t_4~0_19, thread2Thread1of1ForFork2_#t~ret4#1=|v_thread2Thread1of1ForFork2_#t~ret4#1_1|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, ~s_2~0=v_~s_2~0_39, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, ~s_2~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_plus_#in~a#1] 41297#[L56, L168-4, L91-3]don't care [2022-07-22 12:19:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash -836341118, now seen corresponding path program 1 times [2022-07-22 12:19:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:52,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319805924] [2022-07-22 12:19:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:52,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:52,322 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:52,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:52,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:52,354 INFO L85 PathProgramCache]: Analyzing trace with hash 39255, now seen corresponding path program 2 times [2022-07-22 12:19:52,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:52,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690727399] [2022-07-22 12:19:52,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:52,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:52,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:52,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:52,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash -564891752, now seen corresponding path program 1 times [2022-07-22 12:19:52,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:52,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843325834] [2022-07-22 12:19:52,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:52,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:19:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:19:52,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:19:52,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843325834] [2022-07-22 12:19:52,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843325834] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:19:52,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994125974] [2022-07-22 12:19:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:52,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:19:52,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:19:52,541 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:19:52,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-07-22 12:19:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:19:52,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 12:19:52,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:19:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:19:52,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:19:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:19:52,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994125974] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:19:52,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:19:52,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-07-22 12:19:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881658694] [2022-07-22 12:19:52,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:19:53,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:19:53,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 12:19:53,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-07-22 12:19:53,172 INFO L87 Difference]: Start difference. First operand 4920 states and 22357 transitions. cyclomatic complexity: 18842 Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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:19:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:19:54,004 INFO L93 Difference]: Finished difference Result 8104 states and 34053 transitions. [2022-07-22 12:19:54,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8104 states and 34053 transitions. [2022-07-22 12:19:54,223 INFO L131 ngComponentsAnalysis]: Automaton has 2150 accepting balls. 5652 [2022-07-22 12:19:54,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8104 states to 7366 states and 31138 transitions. [2022-07-22 12:19:54,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7364 [2022-07-22 12:19:54,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7364 [2022-07-22 12:19:54,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7366 states and 31138 transitions. [2022-07-22 12:19:54,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:19:54,385 INFO L220 hiAutomatonCegarLoop]: Abstraction has 7366 states and 31138 transitions. [2022-07-22 12:19:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states and 31138 transitions. [2022-07-22 12:19:54,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 5606. [2022-07-22 12:19:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5606 states, 5606 states have (on average 4.349268640742062) internal successors, (24382), 5605 states have internal predecessors, (24382), 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:19:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 24382 transitions. [2022-07-22 12:19:54,832 INFO L242 hiAutomatonCegarLoop]: Abstraction has 5606 states and 24382 transitions. [2022-07-22 12:19:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:19:54,834 INFO L425 stractBuchiCegarLoop]: Abstraction has 5606 states and 24382 transitions. [2022-07-22 12:19:54,835 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:19:54,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5606 states and 24382 transitions. [2022-07-22 12:19:54,889 INFO L131 ngComponentsAnalysis]: Automaton has 1604 accepting balls. 4392 [2022-07-22 12:19:54,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:19:54,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:19:54,890 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:19:54,891 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:19:54,892 INFO L748 eck$LassoCheckResult]: Stem: 60295#[ULTIMATE.startENTRY]don't care [1254] ULTIMATE.startENTRY-->L184-6: Formula: (let ((.cse1 (store |v_#valid_747| |v_ULTIMATE.start_main_~#t1~0#1.base_65| 1))) (let ((.cse2 (select |v_#memory_int_421| 1)) (.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_91| 1))) (and (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_48| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|) (= (select .cse1 |v_ULTIMATE.start_main_~#t4~0#1.base_91|) 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_103| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (= (select .cse2 0) 48) (= (+ v_~n_1~0_233 1) |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|) (= v_~X_0~0.base_153 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_103| 0)) (not (= (ite (< v_~n_1~0_233 2147483647) 1 0) 0)) (= v_~X_0~0.offset_153 0) (= |v_#NULL.base_12| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| 0)) (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_52| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|) (< |v_#StackHeapBarrier_137| |v_ULTIMATE.start_main_~#t4~0#1.base_91|) (= (store (store (store |v_#length_522| |v_ULTIMATE.start_main_~#t1~0#1.base_65| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_91| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|)) |v_#length_520|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_52|) 1 0) 0)) (= (select |v_#valid_747| 0) 0) (= (select |v_#valid_747| 1) 1) (= (select |v_#valid_747| 2) 1) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_55| 0) (< 0 |v_#StackHeapBarrier_137|) (= (select |v_#valid_747| |v_ULTIMATE.start_main_~#t1~0#1.base_65|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_39| 0) (= 34 (select |v_#length_522| 2)) (= (select .cse2 1) 0) (= 2 (select |v_#length_522| 1)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| |v_#StackHeapBarrier_137|) (= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_81|) (< |v_#StackHeapBarrier_137| |v_ULTIMATE.start_main_~#t1~0#1.base_65|) (= |v_#NULL.offset_12| 0) (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39| 1) |v_#valid_745|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_137|, #valid=|v_#valid_747|, #memory_int=|v_#memory_int_421|, #length=|v_#length_522|} OutVars{~s_6~0=v_~s_6~0_107, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_39|, ~t_9~0=v_~t_9~0_91, ~s_2~0=v_~s_2~0_109, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_31|, ULTIMATE.start_main_#t~mem43#1=|v_ULTIMATE.start_main_#t~mem43#1_36|, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base_37|, ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_48|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_42|, #length=|v_#length_520|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_91|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_39|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_42|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_18|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_52|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #StackHeapBarrier=|v_#StackHeapBarrier_137|, ~n_1~0=v_~n_1~0_233, ULTIMATE.start_main_#t~nondet33#1=|v_ULTIMATE.start_main_#t~nondet33#1_38|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_38|, ~X_0~0.offset=v_~X_0~0.offset_153, ~t_5~0=v_~t_5~0_67, ULTIMATE.start_create_fresh_int_array_#t~post46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post46#1_23|, ~i_3~0=v_~i_3~0_214, ULTIMATE.start_main_#t~ret38#1.offset=|v_ULTIMATE.start_main_#t~ret38#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_48|, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_38|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_#t~nondet42#1=|v_ULTIMATE.start_main_#t~nondet42#1_27|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_55|, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_24|, ~t_4~0=v_~t_4~0_61, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset_37|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_103|, ULTIMATE.start_main_#t~nondet35#1=|v_ULTIMATE.start_main_#t~nondet35#1_42|, ~t_8~0=v_~t_8~0_79, ~i_7~0=v_~i_7~0_246, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_40|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ULTIMATE.start_main_#t~pre41#1=|v_ULTIMATE.start_main_#t~pre41#1_63|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_65|, ~X_0~0.base=v_~X_0~0.base_153, ULTIMATE.start_main_#t~nondet40#1=|v_ULTIMATE.start_main_#t~nondet40#1_25|, #NULL.base=|v_#NULL.base_12|, #valid=|v_#valid_745|, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_40|, #memory_int=|v_#memory_int_421|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_81|, ULTIMATE.start_main_#t~ret38#1.base=|v_ULTIMATE.start_main_#t~ret38#1.base_29|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_75|} AuxVars[] AssignedVars[~s_6~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~t_9~0, ~s_2~0, ULTIMATE.start_main_#t~pre39#1, ULTIMATE.start_main_#t~mem43#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.base, ULTIMATE.start_main_#t~mem44#1, ULTIMATE.start_main_#t~nondet30#1, #length, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~n_1~0, ULTIMATE.start_main_#t~nondet33#1, ULTIMATE.start_main_#t~nondet32#1, ~X_0~0.offset, ~t_5~0, ULTIMATE.start_create_fresh_int_array_#t~post46#1, ~i_3~0, ULTIMATE.start_main_#t~ret38#1.offset, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_main_#t~nondet34#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~nondet42#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1, ~t_4~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_create_fresh_int_array_#t~malloc45#1.offset, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet35#1, ~t_8~0, ~i_7~0, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~pre41#1, ULTIMATE.start_main_~#t1~0#1.base, ~X_0~0.base, ULTIMATE.start_main_#t~nondet40#1, #NULL.base, #valid, ULTIMATE.start_main_#t~nondet37#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_#t~ret38#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 58027#[L184-6]don't care [1207] L184-6-->L184-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4) (select |v_#length_354| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|)) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_26|) (= (store |v_#memory_int_292| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_292| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_13|)) |v_#memory_int_291|) (= (select |v_#valid_463| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| |v_ULTIMATE.start_create_fresh_int_array_~size#1_26|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_13|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27|, #valid=|v_#valid_463|, #memory_int=|v_#memory_int_292|, #length=|v_#length_354|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_26|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post46#1_13|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_26|, #valid=|v_#valid_463|, #memory_int=|v_#memory_int_291|, #length=|v_#length_354|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_26|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post46#1, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int] 58029#[L184-6]don't care [1207] L184-6-->L184-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|))) (and (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4) (select |v_#length_354| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|)) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_26|) (= (store |v_#memory_int_292| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_292| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_13|)) |v_#memory_int_291|) (= (select |v_#valid_463| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27| |v_ULTIMATE.start_create_fresh_int_array_~size#1_26|) (<= 0 .cse1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet47#1_13|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_27|, #valid=|v_#valid_463|, #memory_int=|v_#memory_int_292|, #length=|v_#length_354|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_26|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post46#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post46#1_13|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_26|, #valid=|v_#valid_463|, #memory_int=|v_#memory_int_291|, #length=|v_#length_354|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_26|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post46#1, ULTIMATE.start_create_fresh_int_array_#t~nondet47#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int] 58033#[L184-6]don't care [1235] L184-6-->L168-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36| |v_ULTIMATE.start_create_fresh_int_array_~size#1_40|)) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_43|) (select |v_#length_496| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|) (= |v_ULTIMATE.start_main_#t~pre39#1_25| |v_#pthreadsForks_130|) (= |v_#memory_int_413| (store |v_#memory_int_414| |v_ULTIMATE.start_main_~#t1~0#1.base_49| (store (select |v_#memory_int_414| |v_ULTIMATE.start_main_~#t1~0#1.base_49|) |v_ULTIMATE.start_main_~#t1~0#1.offset_43| |v_ULTIMATE.start_main_#t~pre39#1_25|))) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16| v_~X_0~0.base_147) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_43|) (= 1 (select |v_#valid_711| |v_ULTIMATE.start_main_~#t1~0#1.base_49|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16| v_~X_0~0.offset_147) (= |v_#pthreadsForks_129| (+ |v_#pthreadsForks_130| 1))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, #pthreadsForks=|v_#pthreadsForks_130|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, #valid=|v_#valid_711|, #memory_int=|v_#memory_int_414|, #length=|v_#length_496|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_27|, ULTIMATE.start_main_#t~ret38#1.offset=|v_ULTIMATE.start_main_#t~ret38#1.offset_23|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_27|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_36|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_25|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_49|, ~X_0~0.base=v_~X_0~0.base_147, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_16|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_40|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_16|, #pthreadsForks=|v_#pthreadsForks_129|, #valid=|v_#valid_711|, #memory_int=|v_#memory_int_413|, #length=|v_#length_496|, ~X_0~0.offset=v_~X_0~0.offset_147, ULTIMATE.start_main_#t~ret38#1.base=|v_ULTIMATE.start_main_#t~ret38#1.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~ret38#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~pre39#1, #memory_int, ~X_0~0.offset, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret38#1.base] 61313#[L168-3]don't care [1045] L168-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork5_thidvar2_2 0) (= v_thread1Thread1of1ForFork5_thidvar0_2 |v_ULTIMATE.start_main_#t~pre39#1_6|) (= v_thread1Thread1of1ForFork5_thidvar1_2 0) (= v_thread1Thread1of1ForFork5_thidvar4_2 0) (= v_thread1Thread1of1ForFork5_thidvar5_2 0) (= v_thread1Thread1of1ForFork5_thidvar3_2 0)) InVars {ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|} OutVars{thread1Thread1of1ForFork5_#t~nondet10=|v_thread1Thread1of1ForFork5_#t~nondet10_4|, thread1Thread1of1ForFork5_#t~nondet12=|v_thread1Thread1of1ForFork5_#t~nondet12_4|, thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_8|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_10|, ULTIMATE.start_main_#t~pre39#1=|v_ULTIMATE.start_main_#t~pre39#1_6|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_12|, thread1Thread1of1ForFork5_thidvar5=v_thread1Thread1of1ForFork5_thidvar5_2, thread1Thread1of1ForFork5_thidvar4=v_thread1Thread1of1ForFork5_thidvar4_2, thread1Thread1of1ForFork5_thidvar3=v_thread1Thread1of1ForFork5_thidvar3_2, thread1Thread1of1ForFork5_thidvar2=v_thread1Thread1of1ForFork5_thidvar2_2, thread1Thread1of1ForFork5_thidvar1=v_thread1Thread1of1ForFork5_thidvar1_2, thread1Thread1of1ForFork5_#res.offset=|v_thread1Thread1of1ForFork5_#res.offset_4|, thread1Thread1of1ForFork5_~#t3~0.offset=|v_thread1Thread1of1ForFork5_~#t3~0.offset_10|, thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2, thread1Thread1of1ForFork5_~#t3~0.base=|v_thread1Thread1of1ForFork5_~#t3~0.base_12|, thread1Thread1of1ForFork5_#t~pre11=|v_thread1Thread1of1ForFork5_#t~pre11_8|, thread1Thread1of1ForFork5_#t~mem13=|v_thread1Thread1of1ForFork5_#t~mem13_6|, thread1Thread1of1ForFork5_#t~mem14=|v_thread1Thread1of1ForFork5_#t~mem14_6|, thread1Thread1of1ForFork5_#res.base=|v_thread1Thread1of1ForFork5_#res.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_#t~nondet10, thread1Thread1of1ForFork5_#t~nondet12, thread1Thread1of1ForFork5_#t~pre9, thread1Thread1of1ForFork5_~#t2~0.offset, thread1Thread1of1ForFork5_~#t2~0.base, thread1Thread1of1ForFork5_thidvar5, thread1Thread1of1ForFork5_thidvar4, thread1Thread1of1ForFork5_thidvar3, thread1Thread1of1ForFork5_thidvar2, thread1Thread1of1ForFork5_thidvar1, thread1Thread1of1ForFork5_#res.offset, thread1Thread1of1ForFork5_~#t3~0.offset, thread1Thread1of1ForFork5_thidvar0, thread1Thread1of1ForFork5_~#t3~0.base, thread1Thread1of1ForFork5_#t~pre11, thread1Thread1of1ForFork5_#t~mem13, thread1Thread1of1ForFork5_#t~mem14, thread1Thread1of1ForFork5_#res.base] 61309#[L168-4, thread1ENTRY]don't care [934] thread1ENTRY-->L84: Formula: (and (= (store |v_#length_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_1| 4) |v_#length_1|) (= |v_thread1Thread1of1ForFork5_~#t2~0.offset_1| 0) (not (= |v_thread1Thread1of1ForFork5_~#t2~0.base_1| 0)) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_1|) 0) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork5_~#t2~0.base_1|) (= |v_#valid_1| (store |v_#valid_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_1|, #valid=|v_#valid_1|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_~#t2~0.offset, #valid, #length, thread1Thread1of1ForFork5_~#t2~0.base] 61311#[L84, L168-4]don't care [1094] L84-->L89: Formula: (and (= (store |v_#valid_124| |v_thread1Thread1of1ForFork5_~#t3~0.base_15| 1) |v_#valid_123|) (= (select |v_#valid_124| |v_thread1Thread1of1ForFork5_~#t3~0.base_15|) 0) (= v_~i_3~0_100 0) (not (= |v_thread1Thread1of1ForFork5_~#t3~0.base_15| 0)) (< |v_#StackHeapBarrier_19| |v_thread1Thread1of1ForFork5_~#t3~0.base_15|) (= (store |v_#length_101| |v_thread1Thread1of1ForFork5_~#t3~0.base_15| 4) |v_#length_100|) (= v_~s_2~0_49 0) (= |v_thread1Thread1of1ForFork5_~#t3~0.offset_13| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_124|, #length=|v_#length_101|} OutVars{~i_3~0=v_~i_3~0_100, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~s_2~0=v_~s_2~0_49, thread1Thread1of1ForFork5_~#t3~0.offset=|v_thread1Thread1of1ForFork5_~#t3~0.offset_13|, thread1Thread1of1ForFork5_~#t3~0.base=|v_thread1Thread1of1ForFork5_~#t3~0.base_15|, #valid=|v_#valid_123|, #length=|v_#length_100|} AuxVars[] AssignedVars[~i_3~0, ~s_2~0, thread1Thread1of1ForFork5_~#t3~0.offset, thread1Thread1of1ForFork5_~#t3~0.base, #valid, #length] 61521#[L168-4, L89]don't care [937] L89-->L91: Formula: (= |v_thread1Thread1of1ForFork5_#t~pre9_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_#t~pre9] 61657#[L91, L168-4]don't care [938] L91-->L91-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 60869#[L91-1, L168-4]don't care [939] L91-1-->L91-2: Formula: (and (<= (+ |v_thread1Thread1of1ForFork5_~#t2~0.offset_3| 4) (select |v_#length_5| |v_thread1Thread1of1ForFork5_~#t2~0.base_3|)) (= (select |v_#valid_5| |v_thread1Thread1of1ForFork5_~#t2~0.base_3|) 1) (<= 0 |v_thread1Thread1of1ForFork5_~#t2~0.offset_3|) (= (store |v_#memory_int_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_3| (store (select |v_#memory_int_2| |v_thread1Thread1of1ForFork5_~#t2~0.base_3|) |v_thread1Thread1of1ForFork5_~#t2~0.offset_3| |v_thread1Thread1of1ForFork5_#t~pre9_3|)) |v_#memory_int_1|)) InVars {thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_3|, #valid=|v_#valid_5|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_3|} OutVars{thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_3|, #valid=|v_#valid_5|, thread1Thread1of1ForFork5_~#t2~0.offset=|v_thread1Thread1of1ForFork5_~#t2~0.offset_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_5|, thread1Thread1of1ForFork5_~#t2~0.base=|v_thread1Thread1of1ForFork5_~#t2~0.base_3|} AuxVars[] AssignedVars[#memory_int] 60841#[L168-4, L91-2]don't care [1048] L91-2-->L56: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar1_4) (= |v_thread1Thread1of1ForFork5_#t~pre9_10| v_thread2Thread1of1ForFork2_thidvar0_4)) InVars {thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_10|} OutVars{thread2Thread1of1ForFork2_#t~nondet1#1=|v_thread2Thread1of1ForFork2_#t~nondet1#1_12|, thread1Thread1of1ForFork5_#t~pre9=|v_thread1Thread1of1ForFork5_#t~pre9_10|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_6|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_6|, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_6|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_6|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_6|, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_#t~ret4#1=|v_thread2Thread1of1ForFork2_#t~ret4#1_6|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_10|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_6|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_6|, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_6|, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~nondet1#1, thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_#t~post2#1, thread2Thread1of1ForFork2_plus_#in~a#1] 60691#[L56, L168-4, L91-3]don't care [2022-07-22 12:19:54,893 INFO L750 eck$LassoCheckResult]: Loop: 60691#[L56, L168-4, L91-3]don't care [1204] L56-->L53: Formula: (let ((.cse0 (* v_~i_3~0_150 4))) (let ((.cse1 (+ .cse0 v_~X_0~0.offset_99))) (and (<= (+ .cse0 v_~X_0~0.offset_99 4) (select |v_#length_350| v_~X_0~0.base_99)) (= (select |v_#valid_459| v_~X_0~0.base_99) 1) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_29| 0)) (= (select (select |v_#memory_int_285| v_~X_0~0.base_99) .cse1) v_~t_4~0_39) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29| (ite (< v_~i_3~0_151 v_~n_1~0_159) 1 0)) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet1#1_22| 256) 0)) (= v_~i_3~0_150 (+ v_~i_3~0_151 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_29|) (<= 0 .cse1)))) InVars {~i_3~0=v_~i_3~0_151, thread2Thread1of1ForFork2_#t~nondet1#1=|v_thread2Thread1of1ForFork2_#t~nondet1#1_22|, ~n_1~0=v_~n_1~0_159, #valid=|v_#valid_459|, #memory_int=|v_#memory_int_285|, ~X_0~0.offset=v_~X_0~0.offset_99, #length=|v_#length_350|, ~X_0~0.base=v_~X_0~0.base_99} OutVars{~i_3~0=v_~i_3~0_150, thread2Thread1of1ForFork2_#t~mem3#1=|v_thread2Thread1of1ForFork2_#t~mem3#1_13|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_29|, ~X_0~0.base=v_~X_0~0.base_99, ~t_4~0=v_~t_4~0_39, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_29|, ~n_1~0=v_~n_1~0_159, #valid=|v_#valid_459|, thread2Thread1of1ForFork2_#t~post2#1=|v_thread2Thread1of1ForFork2_#t~post2#1_13|, #memory_int=|v_#memory_int_285|, ~X_0~0.offset=v_~X_0~0.offset_99, #length=|v_#length_350|} AuxVars[] AssignedVars[~i_3~0, thread2Thread1of1ForFork2_#t~nondet1#1, ~t_4~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem3#1, thread2Thread1of1ForFork2_#t~post2#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] 60689#[L168-4, L53, L91-3]don't care [970] L53-->L56: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1|))) (and (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_1| |v_thread2Thread1of1ForFork2_plus_~a#1_1|) (= v_~s_2~0_40 |v_thread2Thread1of1ForFork2_plus_#in~a#1_1|) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_1| v_~t_4~0_19) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| .cse0) (= |v_thread2Thread1of1ForFork2_plus_#res#1_1| v_~s_2~0_39) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (not (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_1| |v_thread2Thread1of1ForFork2_plus_~b#1_1| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork2_plus_~b#1_1|)) 1 0) 0)))) InVars {~s_2~0=v_~s_2~0_40, ~t_4~0=v_~t_4~0_19} OutVars{~t_4~0=v_~t_4~0_19, thread2Thread1of1ForFork2_#t~ret4#1=|v_thread2Thread1of1ForFork2_#t~ret4#1_1|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, ~s_2~0=v_~s_2~0_39, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, ~s_2~0, thread2Thread1of1ForFork2_plus_~b#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, thread2Thread1of1ForFork2_plus_#in~a#1] 60691#[L56, L168-4, L91-3]don't care [2022-07-22 12:19:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:54,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1078247979, now seen corresponding path program 2 times [2022-07-22 12:19:54,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:54,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663540418] [2022-07-22 12:19:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:54,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:55,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:55,106 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:55,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:55,106 INFO L85 PathProgramCache]: Analyzing trace with hash 39255, now seen corresponding path program 3 times [2022-07-22 12:19:55,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:55,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202283699] [2022-07-22 12:19:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:55,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:55,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:55,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:55,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:19:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1109151189, now seen corresponding path program 2 times [2022-07-22 12:19:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:19:55,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202159845] [2022-07-22 12:19:55,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:19:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:19:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:55,184 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:19:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:19:55,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:19:58,553 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:19:58,553 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:19:58,553 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:19:58,553 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:19:58,553 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:19:58,553 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:19:58,553 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:19:58,553 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:19:58,553 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-parallel-sum-1-dsl.wvr.c_BEv2_Iteration4_Lasso [2022-07-22 12:19:58,553 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:19:58,554 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:19:58,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:58,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:19:59,208 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:19:59,211 INFO L158 Benchmark]: Toolchain (without parser) took 23083.90ms. Allocated memory was 153.1MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 127.6MB in the beginning and 717.8MB in the end (delta: -590.1MB). Peak memory consumption was 353.7MB. Max. memory is 8.0GB. [2022-07-22 12:19:59,212 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 153.1MB. Free memory was 123.0MB in the beginning and 123.0MB in the end (delta: 77.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:19:59,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.18ms. Allocated memory is still 153.1MB. Free memory was 127.4MB in the beginning and 114.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-07-22 12:19:59,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.13ms. Allocated memory is still 153.1MB. Free memory was 114.9MB in the beginning and 112.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:19:59,218 INFO L158 Benchmark]: Boogie Preprocessor took 47.14ms. Allocated memory is still 153.1MB. Free memory was 112.2MB in the beginning and 110.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:19:59,218 INFO L158 Benchmark]: RCFGBuilder took 1211.42ms. Allocated memory is still 153.1MB. Free memory was 110.2MB in the beginning and 96.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-07-22 12:19:59,219 INFO L158 Benchmark]: BuchiAutomizer took 21436.28ms. Allocated memory was 153.1MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 96.6MB in the beginning and 717.8MB in the end (delta: -621.2MB). Peak memory consumption was 323.6MB. Max. memory is 8.0GB. [2022-07-22 12:19:59,227 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 153.1MB. Free memory was 123.0MB in the beginning and 123.0MB in the end (delta: 77.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 320.18ms. Allocated memory is still 153.1MB. Free memory was 127.4MB in the beginning and 114.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.13ms. Allocated memory is still 153.1MB. Free memory was 114.9MB in the beginning and 112.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.14ms. Allocated memory is still 153.1MB. Free memory was 112.2MB in the beginning and 110.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1211.42ms. Allocated memory is still 153.1MB. Free memory was 110.2MB in the beginning and 96.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 21436.28ms. Allocated memory was 153.1MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 96.6MB in the beginning and 717.8MB in the end (delta: -621.2MB). Peak memory consumption was 323.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 222 PlacesBefore, 75 PlacesAfterwards, 221 TransitionsBefore, 65 TransitionsAfterwards, 7312 CoEnabledTransitionPairs, 8 FixpointIterations, 100 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 11 ConcurrentYvCompositions, 9 ChoiceCompositions, 179 TotalNumberOfCompositions, 29777 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16102, positive: 15625, positive conditional: 0, positive unconditional: 15625, negative: 477, negative conditional: 0, negative unconditional: 477, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4946, positive: 4852, positive conditional: 0, positive unconditional: 4852, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4946, positive: 4795, positive conditional: 0, positive unconditional: 4795, negative: 151, negative conditional: 0, negative unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 151, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 419, positive: 147, positive conditional: 0, positive unconditional: 147, negative: 273, negative conditional: 0, negative unconditional: 273, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16102, positive: 10773, positive conditional: 0, positive unconditional: 10773, negative: 383, negative conditional: 0, negative unconditional: 383, unknown: 4946, unknown conditional: 0, unknown unconditional: 4946] , Statistics on independence cache: Total cache size (in pairs): 1085, Positive cache size: 1027, Positive conditional cache size: 0, Positive unconditional cache size: 1027, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58 - 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:19:59,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-07-22 12:19:59,498 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...