/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:45:38,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:45:38,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:45:38,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:45:38,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:45:38,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:45:38,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:45:38,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:45:38,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:45:38,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:45:38,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:45:38,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:45:38,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:45:38,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:45:38,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:45:38,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:45:38,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:45:38,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:45:38,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:45:38,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:45:38,468 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:45:38,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:45:38,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:45:38,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:45:38,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:45:38,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:45:38,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:45:38,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:45:38,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:45:38,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:45:38,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:45:38,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:45:38,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:45:38,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:45:38,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:45:38,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:45:38,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:45:38,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:45:38,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:45:38,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:45:38,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:45:38,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:45:38,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:45:38,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:45:38,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:45:38,545 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:45:38,545 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:45:38,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:45:38,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:45:38,547 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:45:38,547 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:45:38,548 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:45:38,548 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:45:38,548 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:45:38,548 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:45:38,548 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:45:38,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:45:38,549 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:45:38,549 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:45:38,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:45:38,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:45:38,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:45:38,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:45:38,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:45:38,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:45:38,550 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:45:38,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:45:38,551 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:45:38,551 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:45:38,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:45:38,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:45:38,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:45:38,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:45:38,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:45:38,552 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:45:38,553 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:45:38,553 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:45:38,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:45:38,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:45:38,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:45:38,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:45:38,924 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:45:38,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-07-22 12:45:39,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853655853/ea02c8eacf124ff28e61a1ad9f3d91f9/FLAG82b51fffc [2022-07-22 12:45:39,752 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:45:39,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-07-22 12:45:39,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853655853/ea02c8eacf124ff28e61a1ad9f3d91f9/FLAG82b51fffc [2022-07-22 12:45:40,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853655853/ea02c8eacf124ff28e61a1ad9f3d91f9 [2022-07-22 12:45:40,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:45:40,102 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:45:40,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:45:40,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:45:40,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:45:40,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:45:40" (1/1) ... [2022-07-22 12:45:40,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25bffdac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:45:40, skipping insertion in model container [2022-07-22 12:45:40,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:45:40" (1/1) ... [2022-07-22 12:45:40,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:45:40,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:45:40,398 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-equiv.wvr.c[3770,3783] [2022-07-22 12:45:40,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:45:40,423 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:45:40,451 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-equiv.wvr.c[3770,3783] [2022-07-22 12:45:40,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:45:40,475 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:45:40,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:45:40 WrapperNode [2022-07-22 12:45:40,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:45:40,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:45:40,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:45:40,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:45:40,485 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:45:40" (1/1) ... [2022-07-22 12:45:40,498 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:45:40" (1/1) ... [2022-07-22 12:45:40,537 INFO L137 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 233 [2022-07-22 12:45:40,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:45:40,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:45:40,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:45:40,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:45:40,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:45:40" (1/1) ... [2022-07-22 12:45:40,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:45:40" (1/1) ... [2022-07-22 12:45:40,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:45:40" (1/1) ... [2022-07-22 12:45:40,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:45:40" (1/1) ... [2022-07-22 12:45:40,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:45:40" (1/1) ... [2022-07-22 12:45:40,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:45:40" (1/1) ... [2022-07-22 12:45:40,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:45:40" (1/1) ... [2022-07-22 12:45:40,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:45:40,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:45:40,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:45:40,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:45:40,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:45:40" (1/1) ... [2022-07-22 12:45:40,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:40,628 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:45:40,643 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:45:40,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:45:40,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:45:40,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:45:40,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:45:40,692 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:45:40,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:45:40,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:45:40,697 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:45:40,697 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:45:40,697 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:45:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-22 12:45:40,698 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-22 12:45:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:45:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:45:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:45:40,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:45:40,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:45:40,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:45:40,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:45:40,701 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:45:40,813 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:45:40,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:45:41,330 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:45:41,491 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:45:41,491 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:45:41,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:45:41 BoogieIcfgContainer [2022-07-22 12:45:41,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:45:41,495 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:45:41,496 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:45:41,507 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:45:41,508 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:45:41,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:45:40" (1/3) ... [2022-07-22 12:45:41,509 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64d7c795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:45:41, skipping insertion in model container [2022-07-22 12:45:41,509 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:45:41,510 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:45:40" (2/3) ... [2022-07-22 12:45:41,510 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64d7c795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:45:41, skipping insertion in model container [2022-07-22 12:45:41,510 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:45:41,510 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:45:41" (3/3) ... [2022-07-22 12:45:41,514 INFO L322 chiAutomizerObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-07-22 12:45:41,708 INFO L144 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-07-22 12:45:41,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 194 places, 199 transitions, 442 flow [2022-07-22 12:45:41,823 INFO L129 PetriNetUnfolder]: 14/180 cut-off events. [2022-07-22 12:45:41,824 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 12:45:41,833 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 180 events. 14/180 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 152 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 153. Up to 3 conditions per place. [2022-07-22 12:45:41,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 199 transitions, 442 flow [2022-07-22 12:45:41,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 180 transitions, 390 flow [2022-07-22 12:45:41,854 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:45:41,867 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 180 transitions, 390 flow [2022-07-22 12:45:41,872 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 180 transitions, 390 flow [2022-07-22 12:45:41,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 179 places, 180 transitions, 390 flow [2022-07-22 12:45:41,920 INFO L129 PetriNetUnfolder]: 14/180 cut-off events. [2022-07-22 12:45:41,920 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 12:45:41,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 180 events. 14/180 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 162 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 153. Up to 3 conditions per place. [2022-07-22 12:45:41,926 INFO L116 LiptonReduction]: Number of co-enabled transitions 2612 [2022-07-22 12:45:47,013 INFO L131 LiptonReduction]: Checked pairs total: 8367 [2022-07-22 12:45:47,013 INFO L133 LiptonReduction]: Total number of compositions: 164 [2022-07-22 12:45:47,036 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:45:47,036 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:45:47,037 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:45:47,037 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:45:47,037 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:45:47,037 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:45:47,037 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:45:47,038 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:45:47,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:45:47,198 INFO L131 ngComponentsAnalysis]: Automaton has 171 accepting balls. 341 [2022-07-22 12:45:47,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:47,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:47,209 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:45:47,209 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:45:47,209 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:45:47,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 500 states, but on-demand construction may add more states [2022-07-22 12:45:47,239 INFO L131 ngComponentsAnalysis]: Automaton has 171 accepting balls. 341 [2022-07-22 12:45:47,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:47,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:47,240 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:45:47,240 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:45:47,248 INFO L748 eck$LassoCheckResult]: Stem: 197#[ULTIMATE.startENTRY]don't care [989] ULTIMATE.startENTRY-->L154-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= (+ v_~n_1~0_Out_2 1) |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~X_0~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= v_~X_0~0.base_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (not (= (ite (< v_~n_1~0_Out_2 2147483647) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 34)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~s_6~0=v_~s_6~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ~s_2~0=v_~s_2~0_Out_2, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_Out_2|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_Out_2|, #length=|v_#length_Out_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_Out_2|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_Out_2|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~n_1~0=v_~n_1~0_Out_2, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_Out_2|, ~X_0~0.offset=v_~X_0~0.offset_Out_2, ~t_5~0=v_~t_5~0_Out_2, ~i_3~0=v_~i_3~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base_Out_6|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~t_4~0=v_~t_4~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ~t_8~0=v_~t_8~0_Out_2, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_Out_2|, ~i_7~0=v_~i_7~0_Out_2, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_Out_2|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ULTIMATE.start_main_#t~ret27#1.offset=|v_ULTIMATE.start_main_#t~ret27#1.offset_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~X_0~0.base=v_~X_0~0.base_Out_2, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret27#1.base=|v_ULTIMATE.start_main_#t~ret27#1.base_Out_2|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_Out_2|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~s_6~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~i_3~0, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base, ~s_2~0, ULTIMATE.start_main_#t~nondet25#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre30#1, ULTIMATE.start_main_#t~nondet22#1, ~t_4~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t_8~0, #length, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post35#1, ULTIMATE.start_main_#t~nondet26#1, ~i_7~0, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~ret27#1.offset, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre28#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_~#t1~0#1.base, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret27#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem33#1, ~n_1~0, ULTIMATE.start_main_#t~nondet20#1, #valid, ~X_0~0.offset, ~t_5~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 200#[L154-6]don't care [2022-07-22 12:45:47,249 INFO L750 eck$LassoCheckResult]: Loop: 200#[L154-6]don't care [973] L154-6-->L154-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|))) (and (= (select |v_#valid_176| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) 1) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45| 4) (select |v_#length_133| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_44| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| 1)) (<= 0 .cse1) (= (store |v_#memory_int_101| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45| (store (select |v_#memory_int_101| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_29|)) |v_#memory_int_100|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_101|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_44|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_100|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~post35#1] 200#[L154-6]don't care [2022-07-22 12:45:47,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:47,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1020, now seen corresponding path program 1 times [2022-07-22 12:45:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:47,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364331689] [2022-07-22 12:45:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:47,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:47,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:47,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:47,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:47,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1004, now seen corresponding path program 1 times [2022-07-22 12:45:47,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:47,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938777761] [2022-07-22 12:45:47,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:47,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:47,487 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:47,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:47,499 INFO L85 PathProgramCache]: Analyzing trace with hash 32593, now seen corresponding path program 1 times [2022-07-22 12:45:47,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:47,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212877707] [2022-07-22 12:45:47,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:47,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:47,541 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:47,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:48,270 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:45:48,271 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:45:48,271 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:45:48,271 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:45:48,271 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:45:48,272 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:48,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:45:48,272 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:45:48,272 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-parallel-sum-equiv.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:45:48,272 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:45:48,273 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:45:48,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,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:45:48,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,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:45:48,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:48,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:49,204 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:45:49,210 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:45:49,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,214 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:45:49,226 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:45:49,227 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:45:49,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:49,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:49,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,290 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:45:49,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,292 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:45:49,302 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:45:49,303 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:45:49,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:49,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:49,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,365 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:45:49,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,368 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:45:49,369 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:45:49,370 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:45:49,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:49,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:49,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,431 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:45:49,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,433 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:45:49,440 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:45:49,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:49,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:49,455 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:45:49,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,496 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:45:49,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,498 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:45:49,499 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:45:49,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:49,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:49,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:49,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:49,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-22 12:45:49,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,545 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:45:49,546 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:45:49,547 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:45:49,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:49,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:49,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:49,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,580 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:45:49,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,582 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:45:49,583 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:45:49,586 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:45:49,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:49,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:49,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,648 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:45:49,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,650 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:45:49,651 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:45:49,651 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:45:49,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:49,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:49,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,691 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:45:49,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,694 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:45:49,695 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:45:49,696 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:45:49,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:49,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:49,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:49,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,733 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:45:49,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,735 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:45:49,736 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:45:49,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:49,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:49,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:49,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:49,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,802 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:45:49,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,803 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:45:49,809 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:45:49,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:49,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:49,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:49,820 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:45:49,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,864 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:45:49,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,865 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:45:49,877 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:45:49,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:49,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:49,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:49,889 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:45:49,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,921 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:45:49,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,922 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:45:49,924 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:45:49,924 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:45:49,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:49,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:49,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:49,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:49,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:49,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:49,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:49,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:49,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-22 12:45:49,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:49,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:49,991 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:45:49,997 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:45:49,998 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:45:50,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:50,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:50,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:50,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,058 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:45:50,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,059 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:45:50,060 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:45:50,061 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:45:50,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:50,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:50,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:50,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,120 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:45:50,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,122 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:45:50,130 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:45:50,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:50,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:50,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:50,146 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:45:50,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,187 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:45:50,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,189 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:45:50,195 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:45:50,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:50,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:50,213 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:45:50,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,253 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:45:50,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,254 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:45:50,259 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:45:50,259 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:45:50,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:50,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:50,286 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,318 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:45:50,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,319 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:45:50,324 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:45:50,324 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:45:50,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:50,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:50,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:50,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,356 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:45:50,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,357 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:45:50,361 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:45:50,361 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:45:50,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:50,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:50,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:50,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,393 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:45:50,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,394 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:45:50,398 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:45:50,398 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:45:50,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:50,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:50,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:50,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,465 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:45:50,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,466 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:45:50,467 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:45:50,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:50,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:50,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:50,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:50,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:50,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,502 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:45:50,505 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:45:50,505 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:45:50,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,515 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:50,515 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:50,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,577 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:45:50,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,579 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:45:50,589 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:45:50,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,600 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:50,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:50,604 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:45:50,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,645 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:45:50,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,647 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:45:50,649 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:45:50,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:50,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:50,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:50,660 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:45:50,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,698 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:45:50,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,699 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:45:50,700 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:45:50,701 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:45:50,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:50,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:50,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:50,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,751 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:45:50,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,753 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:45:50,755 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:45:50,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:50,766 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:50,770 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:45:50,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 12:45:50,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,811 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:45:50,813 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:45:50,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:45:50,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:50,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:50,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 12:45:50,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,850 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:45:50,851 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:45:50,851 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:45:50,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:50,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:50,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:50,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,889 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:45:50,892 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:45:50,893 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:45:50,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,899 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:45:50,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,905 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:45:50,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:50,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:50,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:50,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:50,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:50,951 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:45:50,951 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:45:50,952 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:45:50,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:50,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:50,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:50,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:50,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:50,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:50,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:51,010 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:45:51,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:51,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:51,012 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:45:51,014 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:45:51,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:51,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:51,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:51,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:51,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:51,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:51,029 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:45:51,043 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:51,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:51,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:51,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:51,097 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:45:51,106 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:45:51,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:51,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:51,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:51,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:51,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:51,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:51,121 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:45:51,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:51,162 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:45:51,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:51,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:51,163 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:45:51,165 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:45:51,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:51,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:51,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:51,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:51,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:51,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:51,180 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:45:51,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:51,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:51,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:51,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:51,219 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:45:51,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:51,221 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:45:51,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:51,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:51,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:51,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:51,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:51,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:51,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:51,271 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:45:51,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:51,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:51,273 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:45:51,274 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:45:51,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:45:51,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:51,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:51,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:51,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:51,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:51,283 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:51,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:51,324 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:45:51,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:51,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:51,326 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:45:51,327 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:45:51,328 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:45:51,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:51,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:45:51,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:51,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:51,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:51,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:45:51,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:45:51,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:51,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-22 12:45:51,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:51,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:51,362 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:45:51,363 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:45:51,363 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:45:51,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:51,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:51,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:51,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:51,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:51,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:51,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:51,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:51,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:51,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:51,401 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:45:51,411 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:45:51,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:51,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:51,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:51,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:51,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:51,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:51,426 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:45:51,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:51,466 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:45:51,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:51,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:51,467 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:45:51,471 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:45:51,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:51,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:51,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:51,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:51,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:51,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:51,487 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:45:51,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:45:51,525 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:45:51,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:51,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:51,526 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:45:51,528 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:45:51,528 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:45:51,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:45:51,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:45:51,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:45:51,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:45:51,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:45:51,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:45:51,568 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:45:51,604 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 12:45:51,604 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2022-07-22 12:45:51,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:51,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:51,608 INFO L229 MonitoredProcess]: Starting monitored process 43 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:45:51,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:45:51,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 12:45:51,643 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:45:51,644 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:45:51,645 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:45:51,680 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:45:51,749 INFO L257 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-07-22 12:45:51,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:51,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:45:51,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:45:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:51,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:45:51,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:45:51,836 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:45:51,886 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:45:51,892 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 500 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:45:52,024 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 500 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 502 states and 1667 transitions. Complement of second has 3 states. [2022-07-22 12:45:52,027 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:45:52,032 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:45:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:45:52,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:45:52,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:52,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:45:52,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:52,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:45:52,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:45:52,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 502 states and 1667 transitions. [2022-07-22 12:45:52,047 INFO L131 ngComponentsAnalysis]: Automaton has 170 accepting balls. 340 [2022-07-22 12:45:52,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 502 states to 480 states and 1600 transitions. [2022-07-22 12:45:52,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 478 [2022-07-22 12:45:52,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 479 [2022-07-22 12:45:52,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 1600 transitions. [2022-07-22 12:45:52,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:45:52,080 INFO L220 hiAutomatonCegarLoop]: Abstraction has 480 states and 1600 transitions. [2022-07-22 12:45:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states and 1600 transitions. [2022-07-22 12:45:52,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2022-07-22 12:45:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 480 states have (on average 3.3333333333333335) internal successors, (1600), 479 states have internal predecessors, (1600), 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:45:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1600 transitions. [2022-07-22 12:45:52,151 INFO L242 hiAutomatonCegarLoop]: Abstraction has 480 states and 1600 transitions. [2022-07-22 12:45:52,152 INFO L425 stractBuchiCegarLoop]: Abstraction has 480 states and 1600 transitions. [2022-07-22 12:45:52,152 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:45:52,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 480 states and 1600 transitions. [2022-07-22 12:45:52,158 INFO L131 ngComponentsAnalysis]: Automaton has 170 accepting balls. 340 [2022-07-22 12:45:52,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:52,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:52,159 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:45:52,159 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:45:52,160 INFO L748 eck$LassoCheckResult]: Stem: 2738#[ULTIMATE.startENTRY]don't care [989] ULTIMATE.startENTRY-->L154-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= (+ v_~n_1~0_Out_2 1) |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~X_0~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= v_~X_0~0.base_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (not (= (ite (< v_~n_1~0_Out_2 2147483647) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 34)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~s_6~0=v_~s_6~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ~s_2~0=v_~s_2~0_Out_2, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_Out_2|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_Out_2|, #length=|v_#length_Out_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_Out_2|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_Out_2|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~n_1~0=v_~n_1~0_Out_2, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_Out_2|, ~X_0~0.offset=v_~X_0~0.offset_Out_2, ~t_5~0=v_~t_5~0_Out_2, ~i_3~0=v_~i_3~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base_Out_6|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~t_4~0=v_~t_4~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ~t_8~0=v_~t_8~0_Out_2, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_Out_2|, ~i_7~0=v_~i_7~0_Out_2, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_Out_2|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ULTIMATE.start_main_#t~ret27#1.offset=|v_ULTIMATE.start_main_#t~ret27#1.offset_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~X_0~0.base=v_~X_0~0.base_Out_2, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret27#1.base=|v_ULTIMATE.start_main_#t~ret27#1.base_Out_2|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_Out_2|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~s_6~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~i_3~0, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base, ~s_2~0, ULTIMATE.start_main_#t~nondet25#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre30#1, ULTIMATE.start_main_#t~nondet22#1, ~t_4~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t_8~0, #length, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post35#1, ULTIMATE.start_main_#t~nondet26#1, ~i_7~0, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~ret27#1.offset, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre28#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_~#t1~0#1.base, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret27#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem33#1, ~n_1~0, ULTIMATE.start_main_#t~nondet20#1, #valid, ~X_0~0.offset, ~t_5~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2332#[L154-6]don't care [970] L154-6-->L138-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre28#1_23|))) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre28#1_23|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_127| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| v_~X_0~0.offset_54) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| v_~X_0~0.base_54) (= (select |v_#valid_170| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_170|, #memory_int=|v_#memory_int_95|, #length=|v_#length_127|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, ULTIMATE.start_main_#t~ret27#1.offset=|v_ULTIMATE.start_main_#t~ret27#1.offset_25|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ~X_0~0.base=v_~X_0~0.base_54, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret27#1.base=|v_ULTIMATE.start_main_#t~ret27#1.base_25|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_170|, #memory_int=|v_#memory_int_94|, #length=|v_#length_127|, ~X_0~0.offset=v_~X_0~0.offset_54} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret27#1.offset, #memory_int, ULTIMATE.start_main_#t~pre28#1, ~X_0~0.offset, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret27#1.base] 2334#[L138-3]don't care [800] L138-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar3_2 0) (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre28#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= v_thread1Thread1of1ForFork0_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_6|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~#t2~0.base=|v_thread1Thread1of1ForFork0_~#t2~0.base_12|, thread1Thread1of1ForFork0_thidvar2=v_thread1Thread1of1ForFork0_thidvar2_2, thread1Thread1of1ForFork0_thidvar3=v_thread1Thread1of1ForFork0_thidvar3_2, thread1Thread1of1ForFork0_~#t2~0.offset=|v_thread1Thread1of1ForFork0_~#t2~0.offset_10|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_6|, thread1Thread1of1ForFork0_#t~pre11=|v_thread1Thread1of1ForFork0_#t~pre11_8|, thread1Thread1of1ForFork0_#t~mem13=|v_thread1Thread1of1ForFork0_#t~mem13_6|, thread1Thread1of1ForFork0_~#t3~0.base=|v_thread1Thread1of1ForFork0_~#t3~0.base_12|, thread1Thread1of1ForFork0_#t~mem14=|v_thread1Thread1of1ForFork0_#t~mem14_6|, thread1Thread1of1ForFork0_#t~nondet10=|v_thread1Thread1of1ForFork0_#t~nondet10_4|, thread1Thread1of1ForFork0_~#t3~0.offset=|v_thread1Thread1of1ForFork0_~#t3~0.offset_10|, thread1Thread1of1ForFork0_#t~nondet12=|v_thread1Thread1of1ForFork0_#t~nondet12_4|, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~#t2~0.base, thread1Thread1of1ForFork0_thidvar2, thread1Thread1of1ForFork0_thidvar3, thread1Thread1of1ForFork0_~#t2~0.offset, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~pre11, thread1Thread1of1ForFork0_#t~mem13, thread1Thread1of1ForFork0_~#t3~0.base, thread1Thread1of1ForFork0_#t~mem14, thread1Thread1of1ForFork0_#t~nondet10, thread1Thread1of1ForFork0_~#t3~0.offset, thread1Thread1of1ForFork0_#t~nondet12, thread1Thread1of1ForFork0_#t~pre9] 2014#[thread1ENTRY, L138-4]don't care [937] L138-4-->L139-1: Formula: (= |v_#pthreadsForks_27| |v_ULTIMATE.start_main_#t~pre30#1_17|) InVars {#pthreadsForks=|v_#pthreadsForks_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_17|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_9|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre28#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_#t~pre30#1] 2018#[L139-1, thread1ENTRY]don't care [574] L139-1-->L139-2: Formula: (= (+ |v_#pthreadsForks_12| 1) |v_#pthreadsForks_11|) InVars {#pthreadsForks=|v_#pthreadsForks_12|} OutVars{#pthreadsForks=|v_#pthreadsForks_11|} AuxVars[] AssignedVars[#pthreadsForks] 2732#[thread1ENTRY, L139-2]don't care [590] L139-2-->L139-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t4~0#1.offset_3| 4) (select |v_#length_22| |v_ULTIMATE.start_main_~#t4~0#1.base_3|)) (= |v_#memory_int_16| (store |v_#memory_int_17| |v_ULTIMATE.start_main_~#t4~0#1.base_3| (store (select |v_#memory_int_17| |v_ULTIMATE.start_main_~#t4~0#1.base_3|) |v_ULTIMATE.start_main_~#t4~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre30#1_3|))) (<= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_3|) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t4~0#1.base_3|) 1)) InVars {#valid=|v_#valid_27|, #memory_int=|v_#memory_int_17|, #length=|v_#length_22|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_3|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_3|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_3|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_3|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_3|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_3|} AuxVars[] AssignedVars[#memory_int] 2728#[thread1ENTRY, L139-3]don't care [806] L139-3-->thread4ENTRY: Formula: (and (= 0 v_thread4Thread1of1ForFork2_thidvar2_2) (= 0 v_thread4Thread1of1ForFork2_thidvar4_2) (= |v_ULTIMATE.start_main_#t~pre30#1_6| v_thread4Thread1of1ForFork2_thidvar0_2) (= 0 v_thread4Thread1of1ForFork2_thidvar3_2) (= 0 v_thread4Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_6|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_4|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_8|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_4|, thread4Thread1of1ForFork2_#t~nondet15#1=|v_thread4Thread1of1ForFork2_#t~nondet15#1_10|, thread4Thread1of1ForFork2_#t~mem17#1=|v_thread4Thread1of1ForFork2_#t~mem17#1_4|, thread4Thread1of1ForFork2_#t~ret18#1=|v_thread4Thread1of1ForFork2_#t~ret18#1_4|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_4|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_6|, thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_2, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_4|, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_4|, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_4|, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_4|, thread4Thread1of1ForFork2_#t~post16#1=|v_thread4Thread1of1ForFork2_#t~post16#1_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#t~nondet15#1, thread4Thread1of1ForFork2_#t~mem17#1, thread4Thread1of1ForFork2_#t~ret18#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_thidvar4, thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#res#1.offset, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post16#1] 2052#[thread4ENTRY, thread1ENTRY, L139-4]don't care [787] thread4ENTRY-->L113: Formula: (and (= v_~i_7~0_9 0) (= v_~s_6~0_7 0)) InVars {} OutVars{~s_6~0=v_~s_6~0_7, ~i_7~0=v_~i_7~0_9} AuxVars[] AssignedVars[~s_6~0, ~i_7~0] 2054#[L113, thread1ENTRY, L139-4]don't care [2022-07-22 12:45:52,161 INFO L750 eck$LassoCheckResult]: Loop: 2054#[L113, thread1ENTRY, L139-4]don't care [927] L113-->L113: Formula: (let ((.cse1 (* v_~i_7~0_63 4))) (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_7| |v_thread4Thread1of1ForFork2_plus_~b#1_7|)) (.cse2 (+ .cse1 v_~X_0~0.offset_44))) (and (= (select |v_#valid_132| v_~X_0~0.base_44) 1) (= (+ v_~i_7~0_64 1) v_~i_7~0_63) (not (= (ite (< v_~i_7~0_64 v_~n_1~0_97) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_7| .cse0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_7| 0)) 1 0)) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork2_plus_~a#1_7| |v_thread4Thread1of1ForFork2_plus_~b#1_7|)) (<= 0 |v_thread4Thread1of1ForFork2_plus_~b#1_7|)) 1 0) 0)) (<= (+ .cse1 v_~X_0~0.offset_44 4) (select |v_#length_97| v_~X_0~0.base_44)) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_7| |v_thread4Thread1of1ForFork2_plus_~b#1_7|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_7| v_~s_6~0_49) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_7| |v_thread4Thread1of1ForFork2_plus_~a#1_7|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_19| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_19| 0)) (= v_~s_6~0_50 |v_thread4Thread1of1ForFork2_plus_#in~a#1_7|) (<= 0 .cse2) (= (select (select |v_#memory_int_74| v_~X_0~0.base_44) .cse2) v_~t_8~0_29) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet15#1_20| 256) 0)) (= v_~t_8~0_29 |v_thread4Thread1of1ForFork2_plus_#in~b#1_7|)))) InVars {~s_6~0=v_~s_6~0_50, thread4Thread1of1ForFork2_#t~nondet15#1=|v_thread4Thread1of1ForFork2_#t~nondet15#1_20|, ~n_1~0=v_~n_1~0_97, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_74|, ~X_0~0.offset=v_~X_0~0.offset_44, #length=|v_#length_97|, ~X_0~0.base=v_~X_0~0.base_44, ~i_7~0=v_~i_7~0_64} OutVars{~s_6~0=v_~s_6~0_49, thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_7|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_19|, thread4Thread1of1ForFork2_#t~mem17#1=|v_thread4Thread1of1ForFork2_#t~mem17#1_7|, thread4Thread1of1ForFork2_#t~ret18#1=|v_thread4Thread1of1ForFork2_#t~ret18#1_7|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_7|, ~X_0~0.base=v_~X_0~0.base_44, ~n_1~0=v_~n_1~0_97, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_7|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_74|, ~t_8~0=v_~t_8~0_29, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_7|, ~X_0~0.offset=v_~X_0~0.offset_44, #length=|v_#length_97|, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_7|, thread4Thread1of1ForFork2_#t~post16#1=|v_thread4Thread1of1ForFork2_#t~post16#1_7|, ~i_7~0=v_~i_7~0_63} AuxVars[] AssignedVars[~s_6~0, thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~nondet15#1, thread4Thread1of1ForFork2_#t~mem17#1, thread4Thread1of1ForFork2_#t~ret18#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_#in~a#1, ~t_8~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post16#1, ~i_7~0] 2054#[L113, thread1ENTRY, L139-4]don't care [2022-07-22 12:45:52,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash -548258476, now seen corresponding path program 1 times [2022-07-22 12:45:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:52,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793170357] [2022-07-22 12:45:52,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:52,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:52,200 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:52,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:52,267 INFO L85 PathProgramCache]: Analyzing trace with hash 958, now seen corresponding path program 1 times [2022-07-22 12:45:52,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:52,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614302307] [2022-07-22 12:45:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:52,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:52,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:52,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:52,321 INFO L85 PathProgramCache]: Analyzing trace with hash 183857355, now seen corresponding path program 1 times [2022-07-22 12:45:52,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:52,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102777195] [2022-07-22 12:45:52,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:52,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:52,435 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:45:52,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:45:52,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102777195] [2022-07-22 12:45:52,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102777195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:45:52,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:45:52,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:45:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758053143] [2022-07-22 12:45:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:45:52,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:45:52,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:45:52,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:45:52,624 INFO L87 Difference]: Start difference. First operand 480 states and 1600 transitions. cyclomatic complexity: 1291 Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:45:52,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:45:52,819 INFO L93 Difference]: Finished difference Result 957 states and 3095 transitions. [2022-07-22 12:45:52,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 957 states and 3095 transitions. [2022-07-22 12:45:52,835 INFO L131 ngComponentsAnalysis]: Automaton has 300 accepting balls. 640 [2022-07-22 12:45:52,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 957 states to 881 states and 2881 transitions. [2022-07-22 12:45:52,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 880 [2022-07-22 12:45:52,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 880 [2022-07-22 12:45:52,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 881 states and 2881 transitions. [2022-07-22 12:45:52,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:45:52,857 INFO L220 hiAutomatonCegarLoop]: Abstraction has 881 states and 2881 transitions. [2022-07-22 12:45:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states and 2881 transitions. [2022-07-22 12:45:52,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 801. [2022-07-22 12:45:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 801 states have (on average 3.337078651685393) internal successors, (2673), 800 states have internal predecessors, (2673), 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:45:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 2673 transitions. [2022-07-22 12:45:52,895 INFO L242 hiAutomatonCegarLoop]: Abstraction has 801 states and 2673 transitions. [2022-07-22 12:45:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:45:52,897 INFO L425 stractBuchiCegarLoop]: Abstraction has 801 states and 2673 transitions. [2022-07-22 12:45:52,897 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:45:52,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 801 states and 2673 transitions. [2022-07-22 12:45:52,906 INFO L131 ngComponentsAnalysis]: Automaton has 274 accepting balls. 580 [2022-07-22 12:45:52,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:52,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:52,907 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:45:52,907 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:45:52,908 INFO L748 eck$LassoCheckResult]: Stem: 4691#[ULTIMATE.startENTRY]don't care [989] ULTIMATE.startENTRY-->L154-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= (+ v_~n_1~0_Out_2 1) |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~X_0~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= v_~X_0~0.base_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (not (= (ite (< v_~n_1~0_Out_2 2147483647) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 34)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~s_6~0=v_~s_6~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ~s_2~0=v_~s_2~0_Out_2, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_Out_2|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_Out_2|, #length=|v_#length_Out_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_Out_2|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_Out_2|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~n_1~0=v_~n_1~0_Out_2, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_Out_2|, ~X_0~0.offset=v_~X_0~0.offset_Out_2, ~t_5~0=v_~t_5~0_Out_2, ~i_3~0=v_~i_3~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base_Out_6|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~t_4~0=v_~t_4~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ~t_8~0=v_~t_8~0_Out_2, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_Out_2|, ~i_7~0=v_~i_7~0_Out_2, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_Out_2|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ULTIMATE.start_main_#t~ret27#1.offset=|v_ULTIMATE.start_main_#t~ret27#1.offset_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~X_0~0.base=v_~X_0~0.base_Out_2, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret27#1.base=|v_ULTIMATE.start_main_#t~ret27#1.base_Out_2|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_Out_2|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~s_6~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~i_3~0, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base, ~s_2~0, ULTIMATE.start_main_#t~nondet25#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre30#1, ULTIMATE.start_main_#t~nondet22#1, ~t_4~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t_8~0, #length, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post35#1, ULTIMATE.start_main_#t~nondet26#1, ~i_7~0, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~ret27#1.offset, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre28#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_~#t1~0#1.base, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret27#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem33#1, ~n_1~0, ULTIMATE.start_main_#t~nondet20#1, #valid, ~X_0~0.offset, ~t_5~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4255#[L154-6]don't care [970] L154-6-->L138-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre28#1_23|))) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre28#1_23|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_127| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| v_~X_0~0.offset_54) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| v_~X_0~0.base_54) (= (select |v_#valid_170| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_170|, #memory_int=|v_#memory_int_95|, #length=|v_#length_127|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, ULTIMATE.start_main_#t~ret27#1.offset=|v_ULTIMATE.start_main_#t~ret27#1.offset_25|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ~X_0~0.base=v_~X_0~0.base_54, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret27#1.base=|v_ULTIMATE.start_main_#t~ret27#1.base_25|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_170|, #memory_int=|v_#memory_int_94|, #length=|v_#length_127|, ~X_0~0.offset=v_~X_0~0.offset_54} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret27#1.offset, #memory_int, ULTIMATE.start_main_#t~pre28#1, ~X_0~0.offset, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret27#1.base] 4257#[L138-3]don't care [800] L138-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar3_2 0) (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre28#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= v_thread1Thread1of1ForFork0_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_6|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~#t2~0.base=|v_thread1Thread1of1ForFork0_~#t2~0.base_12|, thread1Thread1of1ForFork0_thidvar2=v_thread1Thread1of1ForFork0_thidvar2_2, thread1Thread1of1ForFork0_thidvar3=v_thread1Thread1of1ForFork0_thidvar3_2, thread1Thread1of1ForFork0_~#t2~0.offset=|v_thread1Thread1of1ForFork0_~#t2~0.offset_10|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_6|, thread1Thread1of1ForFork0_#t~pre11=|v_thread1Thread1of1ForFork0_#t~pre11_8|, thread1Thread1of1ForFork0_#t~mem13=|v_thread1Thread1of1ForFork0_#t~mem13_6|, thread1Thread1of1ForFork0_~#t3~0.base=|v_thread1Thread1of1ForFork0_~#t3~0.base_12|, thread1Thread1of1ForFork0_#t~mem14=|v_thread1Thread1of1ForFork0_#t~mem14_6|, thread1Thread1of1ForFork0_#t~nondet10=|v_thread1Thread1of1ForFork0_#t~nondet10_4|, thread1Thread1of1ForFork0_~#t3~0.offset=|v_thread1Thread1of1ForFork0_~#t3~0.offset_10|, thread1Thread1of1ForFork0_#t~nondet12=|v_thread1Thread1of1ForFork0_#t~nondet12_4|, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~#t2~0.base, thread1Thread1of1ForFork0_thidvar2, thread1Thread1of1ForFork0_thidvar3, thread1Thread1of1ForFork0_~#t2~0.offset, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~pre11, thread1Thread1of1ForFork0_#t~mem13, thread1Thread1of1ForFork0_~#t3~0.base, thread1Thread1of1ForFork0_#t~mem14, thread1Thread1of1ForFork0_#t~nondet10, thread1Thread1of1ForFork0_~#t3~0.offset, thread1Thread1of1ForFork0_#t~nondet12, thread1Thread1of1ForFork0_#t~pre9] 3949#[thread1ENTRY, L138-4]don't care [740] thread1ENTRY-->L84: Formula: (and (= (store |v_#valid_2| |v_thread1Thread1of1ForFork0_~#t2~0.base_1| 1) |v_#valid_1|) (= |v_thread1Thread1of1ForFork0_~#t2~0.offset_1| 0) (= (store |v_#length_2| |v_thread1Thread1of1ForFork0_~#t2~0.base_1| 4) |v_#length_1|) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork0_~#t2~0.base_1|) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork0_~#t2~0.base_1|) 0) (not (= |v_thread1Thread1of1ForFork0_~#t2~0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thread1Thread1of1ForFork0_~#t2~0.offset=|v_thread1Thread1of1ForFork0_~#t2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_~#t2~0.base=|v_thread1Thread1of1ForFork0_~#t2~0.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~#t2~0.base, #valid, thread1Thread1of1ForFork0_~#t2~0.offset, #length] 3951#[L138-4, L84]don't care [741] L84-->L84-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_thread1Thread1of1ForFork0_~#t3~0.base_1|) (= |v_#length_3| (store |v_#length_4| |v_thread1Thread1of1ForFork0_~#t3~0.base_1| 4)) (= (select |v_#valid_4| |v_thread1Thread1of1ForFork0_~#t3~0.base_1|) 0) (= |v_thread1Thread1of1ForFork0_~#t3~0.offset_1| 0) (not (= |v_thread1Thread1of1ForFork0_~#t3~0.base_1| 0)) (= |v_#valid_3| (store |v_#valid_4| |v_thread1Thread1of1ForFork0_~#t3~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{thread1Thread1of1ForFork0_~#t3~0.base=|v_thread1Thread1of1ForFork0_~#t3~0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, thread1Thread1of1ForFork0_~#t3~0.offset=|v_thread1Thread1of1ForFork0_~#t3~0.offset_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~#t3~0.base, #valid, #length, thread1Thread1of1ForFork0_~#t3~0.offset] 4391#[L138-4, L84-1]don't care [877] L84-1-->L91: Formula: (and (= v_~i_3~0_112 0) (= v_~s_2~0_61 0) (= |v_#pthreadsForks_19| |v_thread1Thread1of1ForFork0_#t~pre9_13|)) InVars {#pthreadsForks=|v_#pthreadsForks_19|} OutVars{~i_3~0=v_~i_3~0_112, #pthreadsForks=|v_#pthreadsForks_19|, ~s_2~0=v_~s_2~0_61, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_13|} AuxVars[] AssignedVars[~i_3~0, ~s_2~0, thread1Thread1of1ForFork0_#t~pre9] 4393#[L138-4, L91]don't care [744] L91-->L91-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 4225#[L138-4, L91-1]don't care [745] L91-1-->L91-2: Formula: (and (<= (+ |v_thread1Thread1of1ForFork0_~#t2~0.offset_3| 4) (select |v_#length_5| |v_thread1Thread1of1ForFork0_~#t2~0.base_3|)) (= (select |v_#valid_5| |v_thread1Thread1of1ForFork0_~#t2~0.base_3|) 1) (<= 0 |v_thread1Thread1of1ForFork0_~#t2~0.offset_3|) (= (store |v_#memory_int_2| |v_thread1Thread1of1ForFork0_~#t2~0.base_3| (store (select |v_#memory_int_2| |v_thread1Thread1of1ForFork0_~#t2~0.base_3|) |v_thread1Thread1of1ForFork0_~#t2~0.offset_3| |v_thread1Thread1of1ForFork0_#t~pre9_3|)) |v_#memory_int_1|)) InVars {thread1Thread1of1ForFork0_~#t2~0.base=|v_thread1Thread1of1ForFork0_~#t2~0.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, thread1Thread1of1ForFork0_~#t2~0.offset=|v_thread1Thread1of1ForFork0_~#t2~0.offset_3|, #length=|v_#length_5|, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_3|} OutVars{thread1Thread1of1ForFork0_~#t2~0.base=|v_thread1Thread1of1ForFork0_~#t2~0.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_~#t2~0.offset=|v_thread1Thread1of1ForFork0_~#t2~0.offset_3|, #length=|v_#length_5|, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_3|} AuxVars[] AssignedVars[#memory_int] 4229#[L138-4, L91-2]don't care [812] L91-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~pre9_10| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_10|} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_6|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_6|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_6|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_6|, thread2Thread1of1ForFork1_#t~nondet1#1=|v_thread2Thread1of1ForFork1_#t~nondet1#1_12|, thread2Thread1of1ForFork1_#t~ret4#1=|v_thread2Thread1of1ForFork1_#t~ret4#1_6|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_6|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_6|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_6|, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_6|, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_10|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_#t~nondet1#1, thread2Thread1of1ForFork1_#t~ret4#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 3933#[L91-3, L138-4, L56]don't care [2022-07-22 12:45:52,908 INFO L750 eck$LassoCheckResult]: Loop: 3933#[L91-3, L138-4, L56]don't care [934] L56-->L53: Formula: (let ((.cse1 (* v_~i_3~0_128 4))) (let ((.cse0 (+ .cse1 v_~X_0~0.offset_48))) (and (= (+ v_~i_3~0_129 1) v_~i_3~0_128) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= (ite (< v_~i_3~0_129 v_~n_1~0_101) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (<= 0 .cse0) (<= (+ .cse1 v_~X_0~0.offset_48 4) (select |v_#length_103| v_~X_0~0.base_48)) (= (select |v_#valid_142| v_~X_0~0.base_48) 1) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet1#1_22| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (= (select (select |v_#memory_int_80| v_~X_0~0.base_48) .cse0) v_~t_4~0_33)))) InVars {~i_3~0=v_~i_3~0_129, ~n_1~0=v_~n_1~0_101, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_80|, ~X_0~0.offset=v_~X_0~0.offset_48, #length=|v_#length_103|, ~X_0~0.base=v_~X_0~0.base_48, thread2Thread1of1ForFork1_#t~nondet1#1=|v_thread2Thread1of1ForFork1_#t~nondet1#1_22|} OutVars{~i_3~0=v_~i_3~0_128, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, ~X_0~0.base=v_~X_0~0.base_48, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~t_4~0=v_~t_4~0_33, ~n_1~0=v_~n_1~0_101, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_80|, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_7|, ~X_0~0.offset=v_~X_0~0.offset_48, #length=|v_#length_103|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~i_3~0, ~t_4~0, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_#t~nondet1#1] 3937#[L91-3, L138-4, L53]don't care [776] L53-->L56: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|))) (and (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| v_~t_4~0_21) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| |v_thread2Thread1of1ForFork1_plus_~a#1_1|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= v_~s_2~0_46 |v_thread2Thread1of1ForFork1_plus_#in~a#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)) (= v_~s_2~0_45 |v_thread2Thread1of1ForFork1_plus_#res#1_1|))) InVars {~s_2~0=v_~s_2~0_46, ~t_4~0=v_~t_4~0_21} OutVars{thread2Thread1of1ForFork1_#t~ret4#1=|v_thread2Thread1of1ForFork1_#t~ret4#1_1|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~t_4~0=v_~t_4~0_21, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_1|, ~s_2~0=v_~s_2~0_45, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_1|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret4#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_plus_#res#1, ~s_2~0, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_plus_#in~b#1] 3933#[L91-3, L138-4, L56]don't care [2022-07-22 12:45:52,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash -998401071, now seen corresponding path program 1 times [2022-07-22 12:45:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:52,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345576939] [2022-07-22 12:45:52,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:52,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:52,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:52,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash 30691, now seen corresponding path program 1 times [2022-07-22 12:45:52,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:52,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329949232] [2022-07-22 12:45:52,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:52,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:53,049 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:53,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:53,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:53,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1685692493, now seen corresponding path program 1 times [2022-07-22 12:45:53,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:53,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183770230] [2022-07-22 12:45:53,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:53,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:53,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:53,261 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:45:53,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:45:53,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183770230] [2022-07-22 12:45:53,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183770230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:45:53,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:45:53,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 12:45:53,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684915421] [2022-07-22 12:45:53,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:45:53,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:45:53,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 12:45:53,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 12:45:53,480 INFO L87 Difference]: Start difference. First operand 801 states and 2673 transitions. cyclomatic complexity: 2147 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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:45:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:45:53,717 INFO L93 Difference]: Finished difference Result 711 states and 2144 transitions. [2022-07-22 12:45:53,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 711 states and 2144 transitions. [2022-07-22 12:45:53,729 INFO L131 ngComponentsAnalysis]: Automaton has 170 accepting balls. 340 [2022-07-22 12:45:53,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 711 states to 480 states and 1599 transitions. [2022-07-22 12:45:53,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 479 [2022-07-22 12:45:53,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 479 [2022-07-22 12:45:53,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 1599 transitions. [2022-07-22 12:45:53,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:45:53,739 INFO L220 hiAutomatonCegarLoop]: Abstraction has 480 states and 1599 transitions. [2022-07-22 12:45:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states and 1599 transitions. [2022-07-22 12:45:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2022-07-22 12:45:53,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 480 states have (on average 3.33125) internal successors, (1599), 479 states have internal predecessors, (1599), 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:45:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1599 transitions. [2022-07-22 12:45:53,757 INFO L242 hiAutomatonCegarLoop]: Abstraction has 480 states and 1599 transitions. [2022-07-22 12:45:53,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:45:53,758 INFO L425 stractBuchiCegarLoop]: Abstraction has 480 states and 1599 transitions. [2022-07-22 12:45:53,758 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:45:53,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 480 states and 1599 transitions. [2022-07-22 12:45:53,764 INFO L131 ngComponentsAnalysis]: Automaton has 170 accepting balls. 340 [2022-07-22 12:45:53,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:53,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:53,765 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:45:53,765 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:45:53,766 INFO L748 eck$LassoCheckResult]: Stem: 6997#[ULTIMATE.startENTRY]don't care [989] ULTIMATE.startENTRY-->L154-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= (+ v_~n_1~0_Out_2 1) |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~X_0~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= v_~X_0~0.base_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (not (= (ite (< v_~n_1~0_Out_2 2147483647) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 34)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~s_6~0=v_~s_6~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ~s_2~0=v_~s_2~0_Out_2, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_Out_2|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_Out_2|, #length=|v_#length_Out_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_Out_2|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_Out_2|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~n_1~0=v_~n_1~0_Out_2, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_Out_2|, ~X_0~0.offset=v_~X_0~0.offset_Out_2, ~t_5~0=v_~t_5~0_Out_2, ~i_3~0=v_~i_3~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base_Out_6|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~t_4~0=v_~t_4~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ~t_8~0=v_~t_8~0_Out_2, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_Out_2|, ~i_7~0=v_~i_7~0_Out_2, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_Out_2|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ULTIMATE.start_main_#t~ret27#1.offset=|v_ULTIMATE.start_main_#t~ret27#1.offset_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~X_0~0.base=v_~X_0~0.base_Out_2, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret27#1.base=|v_ULTIMATE.start_main_#t~ret27#1.base_Out_2|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_Out_2|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~s_6~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~i_3~0, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base, ~s_2~0, ULTIMATE.start_main_#t~nondet25#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre30#1, ULTIMATE.start_main_#t~nondet22#1, ~t_4~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t_8~0, #length, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post35#1, ULTIMATE.start_main_#t~nondet26#1, ~i_7~0, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~ret27#1.offset, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre28#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_~#t1~0#1.base, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret27#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem33#1, ~n_1~0, ULTIMATE.start_main_#t~nondet20#1, #valid, ~X_0~0.offset, ~t_5~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 6583#[L154-6]don't care [973] L154-6-->L154-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|))) (and (= (select |v_#valid_176| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) 1) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45| 4) (select |v_#length_133| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_44| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| 1)) (<= 0 .cse1) (= (store |v_#memory_int_101| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45| (store (select |v_#memory_int_101| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_29|)) |v_#memory_int_100|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_101|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_44|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_100|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~post35#1] 6585#[L154-6]don't care [970] L154-6-->L138-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre28#1_23|))) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre28#1_23|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_127| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| v_~X_0~0.offset_54) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| v_~X_0~0.base_54) (= (select |v_#valid_170| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_170|, #memory_int=|v_#memory_int_95|, #length=|v_#length_127|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, ULTIMATE.start_main_#t~ret27#1.offset=|v_ULTIMATE.start_main_#t~ret27#1.offset_25|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ~X_0~0.base=v_~X_0~0.base_54, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret27#1.base=|v_ULTIMATE.start_main_#t~ret27#1.base_25|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_170|, #memory_int=|v_#memory_int_94|, #length=|v_#length_127|, ~X_0~0.offset=v_~X_0~0.offset_54} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret27#1.offset, #memory_int, ULTIMATE.start_main_#t~pre28#1, ~X_0~0.offset, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret27#1.base] 6587#[L138-3]don't care [800] L138-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar3_2 0) (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre28#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= v_thread1Thread1of1ForFork0_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_6|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~#t2~0.base=|v_thread1Thread1of1ForFork0_~#t2~0.base_12|, thread1Thread1of1ForFork0_thidvar2=v_thread1Thread1of1ForFork0_thidvar2_2, thread1Thread1of1ForFork0_thidvar3=v_thread1Thread1of1ForFork0_thidvar3_2, thread1Thread1of1ForFork0_~#t2~0.offset=|v_thread1Thread1of1ForFork0_~#t2~0.offset_10|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_6|, thread1Thread1of1ForFork0_#t~pre11=|v_thread1Thread1of1ForFork0_#t~pre11_8|, thread1Thread1of1ForFork0_#t~mem13=|v_thread1Thread1of1ForFork0_#t~mem13_6|, thread1Thread1of1ForFork0_~#t3~0.base=|v_thread1Thread1of1ForFork0_~#t3~0.base_12|, thread1Thread1of1ForFork0_#t~mem14=|v_thread1Thread1of1ForFork0_#t~mem14_6|, thread1Thread1of1ForFork0_#t~nondet10=|v_thread1Thread1of1ForFork0_#t~nondet10_4|, thread1Thread1of1ForFork0_~#t3~0.offset=|v_thread1Thread1of1ForFork0_~#t3~0.offset_10|, thread1Thread1of1ForFork0_#t~nondet12=|v_thread1Thread1of1ForFork0_#t~nondet12_4|, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~#t2~0.base, thread1Thread1of1ForFork0_thidvar2, thread1Thread1of1ForFork0_thidvar3, thread1Thread1of1ForFork0_~#t2~0.offset, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~pre11, thread1Thread1of1ForFork0_#t~mem13, thread1Thread1of1ForFork0_~#t3~0.base, thread1Thread1of1ForFork0_#t~mem14, thread1Thread1of1ForFork0_#t~nondet10, thread1Thread1of1ForFork0_~#t3~0.offset, thread1Thread1of1ForFork0_#t~nondet12, thread1Thread1of1ForFork0_#t~pre9] 6281#[thread1ENTRY, L138-4]don't care [937] L138-4-->L139-1: Formula: (= |v_#pthreadsForks_27| |v_ULTIMATE.start_main_#t~pre30#1_17|) InVars {#pthreadsForks=|v_#pthreadsForks_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_17|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_9|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre28#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_#t~pre30#1] 6285#[L139-1, thread1ENTRY]don't care [574] L139-1-->L139-2: Formula: (= (+ |v_#pthreadsForks_12| 1) |v_#pthreadsForks_11|) InVars {#pthreadsForks=|v_#pthreadsForks_12|} OutVars{#pthreadsForks=|v_#pthreadsForks_11|} AuxVars[] AssignedVars[#pthreadsForks] 6991#[thread1ENTRY, L139-2]don't care [590] L139-2-->L139-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t4~0#1.offset_3| 4) (select |v_#length_22| |v_ULTIMATE.start_main_~#t4~0#1.base_3|)) (= |v_#memory_int_16| (store |v_#memory_int_17| |v_ULTIMATE.start_main_~#t4~0#1.base_3| (store (select |v_#memory_int_17| |v_ULTIMATE.start_main_~#t4~0#1.base_3|) |v_ULTIMATE.start_main_~#t4~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre30#1_3|))) (<= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_3|) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t4~0#1.base_3|) 1)) InVars {#valid=|v_#valid_27|, #memory_int=|v_#memory_int_17|, #length=|v_#length_22|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_3|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_3|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_3|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_3|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_3|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_3|} AuxVars[] AssignedVars[#memory_int] 6987#[thread1ENTRY, L139-3]don't care [806] L139-3-->thread4ENTRY: Formula: (and (= 0 v_thread4Thread1of1ForFork2_thidvar2_2) (= 0 v_thread4Thread1of1ForFork2_thidvar4_2) (= |v_ULTIMATE.start_main_#t~pre30#1_6| v_thread4Thread1of1ForFork2_thidvar0_2) (= 0 v_thread4Thread1of1ForFork2_thidvar3_2) (= 0 v_thread4Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_6|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_4|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_8|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_4|, thread4Thread1of1ForFork2_#t~nondet15#1=|v_thread4Thread1of1ForFork2_#t~nondet15#1_10|, thread4Thread1of1ForFork2_#t~mem17#1=|v_thread4Thread1of1ForFork2_#t~mem17#1_4|, thread4Thread1of1ForFork2_#t~ret18#1=|v_thread4Thread1of1ForFork2_#t~ret18#1_4|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_4|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_6|, thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_2, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_4|, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_4|, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_4|, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_4|, thread4Thread1of1ForFork2_#t~post16#1=|v_thread4Thread1of1ForFork2_#t~post16#1_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#t~nondet15#1, thread4Thread1of1ForFork2_#t~mem17#1, thread4Thread1of1ForFork2_#t~ret18#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_thidvar4, thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#res#1.offset, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post16#1] 6311#[thread4ENTRY, thread1ENTRY, L139-4]don't care [787] thread4ENTRY-->L113: Formula: (and (= v_~i_7~0_9 0) (= v_~s_6~0_7 0)) InVars {} OutVars{~s_6~0=v_~s_6~0_7, ~i_7~0=v_~i_7~0_9} AuxVars[] AssignedVars[~s_6~0, ~i_7~0] 6313#[L113, thread1ENTRY, L139-4]don't care [2022-07-22 12:45:53,767 INFO L750 eck$LassoCheckResult]: Loop: 6313#[L113, thread1ENTRY, L139-4]don't care [927] L113-->L113: Formula: (let ((.cse1 (* v_~i_7~0_63 4))) (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_7| |v_thread4Thread1of1ForFork2_plus_~b#1_7|)) (.cse2 (+ .cse1 v_~X_0~0.offset_44))) (and (= (select |v_#valid_132| v_~X_0~0.base_44) 1) (= (+ v_~i_7~0_64 1) v_~i_7~0_63) (not (= (ite (< v_~i_7~0_64 v_~n_1~0_97) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_7| .cse0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_7| 0)) 1 0)) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork2_plus_~a#1_7| |v_thread4Thread1of1ForFork2_plus_~b#1_7|)) (<= 0 |v_thread4Thread1of1ForFork2_plus_~b#1_7|)) 1 0) 0)) (<= (+ .cse1 v_~X_0~0.offset_44 4) (select |v_#length_97| v_~X_0~0.base_44)) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_7| |v_thread4Thread1of1ForFork2_plus_~b#1_7|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_7| v_~s_6~0_49) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_7| |v_thread4Thread1of1ForFork2_plus_~a#1_7|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_19| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_19| 0)) (= v_~s_6~0_50 |v_thread4Thread1of1ForFork2_plus_#in~a#1_7|) (<= 0 .cse2) (= (select (select |v_#memory_int_74| v_~X_0~0.base_44) .cse2) v_~t_8~0_29) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet15#1_20| 256) 0)) (= v_~t_8~0_29 |v_thread4Thread1of1ForFork2_plus_#in~b#1_7|)))) InVars {~s_6~0=v_~s_6~0_50, thread4Thread1of1ForFork2_#t~nondet15#1=|v_thread4Thread1of1ForFork2_#t~nondet15#1_20|, ~n_1~0=v_~n_1~0_97, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_74|, ~X_0~0.offset=v_~X_0~0.offset_44, #length=|v_#length_97|, ~X_0~0.base=v_~X_0~0.base_44, ~i_7~0=v_~i_7~0_64} OutVars{~s_6~0=v_~s_6~0_49, thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_7|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_19|, thread4Thread1of1ForFork2_#t~mem17#1=|v_thread4Thread1of1ForFork2_#t~mem17#1_7|, thread4Thread1of1ForFork2_#t~ret18#1=|v_thread4Thread1of1ForFork2_#t~ret18#1_7|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_7|, ~X_0~0.base=v_~X_0~0.base_44, ~n_1~0=v_~n_1~0_97, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_7|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_74|, ~t_8~0=v_~t_8~0_29, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_7|, ~X_0~0.offset=v_~X_0~0.offset_44, #length=|v_#length_97|, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_7|, thread4Thread1of1ForFork2_#t~post16#1=|v_thread4Thread1of1ForFork2_#t~post16#1_7|, ~i_7~0=v_~i_7~0_63} AuxVars[] AssignedVars[~s_6~0, thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~nondet15#1, thread4Thread1of1ForFork2_#t~mem17#1, thread4Thread1of1ForFork2_#t~ret18#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_#in~a#1, ~t_8~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post16#1, ~i_7~0] 6313#[L113, thread1ENTRY, L139-4]don't care [2022-07-22 12:45:53,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1918547873, now seen corresponding path program 1 times [2022-07-22 12:45:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:53,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866946133] [2022-07-22 12:45:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:53,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:53,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:53,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:53,815 INFO L85 PathProgramCache]: Analyzing trace with hash 958, now seen corresponding path program 2 times [2022-07-22 12:45:53,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:53,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204137229] [2022-07-22 12:45:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:53,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:53,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:53,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:53,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash 654559008, now seen corresponding path program 1 times [2022-07-22 12:45:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:53,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879050441] [2022-07-22 12:45:53,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:53,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:53,885 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:45:53,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:45:53,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879050441] [2022-07-22 12:45:53,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879050441] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:45:53,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003549170] [2022-07-22 12:45:53,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:53,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:45:53,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:53,887 INFO L229 MonitoredProcess]: Starting monitored process 44 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:45:53,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-07-22 12:45:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:53,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 12:45:53,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:45:54,025 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:45:54,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:45:54,070 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:45:54,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003549170] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:45:54,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:45:54,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-22 12:45:54,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092506021] [2022-07-22 12:45:54,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:45:54,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:45:54,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 12:45:54,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-22 12:45:54,288 INFO L87 Difference]: Start difference. First operand 480 states and 1599 transitions. cyclomatic complexity: 1290 Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 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:45:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:45:54,561 INFO L93 Difference]: Finished difference Result 958 states and 3096 transitions. [2022-07-22 12:45:54,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 958 states and 3096 transitions. [2022-07-22 12:45:54,578 INFO L131 ngComponentsAnalysis]: Automaton has 300 accepting balls. 640 [2022-07-22 12:45:54,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 958 states to 882 states and 2882 transitions. [2022-07-22 12:45:54,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 880 [2022-07-22 12:45:54,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 880 [2022-07-22 12:45:54,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 882 states and 2882 transitions. [2022-07-22 12:45:54,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:45:54,598 INFO L220 hiAutomatonCegarLoop]: Abstraction has 882 states and 2882 transitions. [2022-07-22 12:45:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states and 2882 transitions. [2022-07-22 12:45:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 802. [2022-07-22 12:45:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 802 states have (on average 3.334164588528678) internal successors, (2674), 801 states have internal predecessors, (2674), 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:45:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 2674 transitions. [2022-07-22 12:45:54,667 INFO L242 hiAutomatonCegarLoop]: Abstraction has 802 states and 2674 transitions. [2022-07-22 12:45:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:45:54,669 INFO L425 stractBuchiCegarLoop]: Abstraction has 802 states and 2674 transitions. [2022-07-22 12:45:54,669 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:45:54,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 802 states and 2674 transitions. [2022-07-22 12:45:54,678 INFO L131 ngComponentsAnalysis]: Automaton has 274 accepting balls. 580 [2022-07-22 12:45:54,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:54,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:54,679 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:45:54,679 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:45:54,680 INFO L748 eck$LassoCheckResult]: Stem: 9174#[ULTIMATE.startENTRY]don't care [989] ULTIMATE.startENTRY-->L154-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= (+ v_~n_1~0_Out_2 1) |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~X_0~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= v_~X_0~0.base_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (not (= (ite (< v_~n_1~0_Out_2 2147483647) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 34)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~s_6~0=v_~s_6~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ~s_2~0=v_~s_2~0_Out_2, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_Out_2|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_Out_2|, #length=|v_#length_Out_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_Out_2|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_Out_2|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~n_1~0=v_~n_1~0_Out_2, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_Out_2|, ~X_0~0.offset=v_~X_0~0.offset_Out_2, ~t_5~0=v_~t_5~0_Out_2, ~i_3~0=v_~i_3~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base_Out_6|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~t_4~0=v_~t_4~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ~t_8~0=v_~t_8~0_Out_2, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_Out_2|, ~i_7~0=v_~i_7~0_Out_2, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_Out_2|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ULTIMATE.start_main_#t~ret27#1.offset=|v_ULTIMATE.start_main_#t~ret27#1.offset_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~X_0~0.base=v_~X_0~0.base_Out_2, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret27#1.base=|v_ULTIMATE.start_main_#t~ret27#1.base_Out_2|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_Out_2|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~s_6~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~i_3~0, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base, ~s_2~0, ULTIMATE.start_main_#t~nondet25#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre30#1, ULTIMATE.start_main_#t~nondet22#1, ~t_4~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t_8~0, #length, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post35#1, ULTIMATE.start_main_#t~nondet26#1, ~i_7~0, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~ret27#1.offset, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre28#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_~#t1~0#1.base, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret27#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem33#1, ~n_1~0, ULTIMATE.start_main_#t~nondet20#1, #valid, ~X_0~0.offset, ~t_5~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 8578#[L154-6]don't care [973] L154-6-->L154-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|))) (and (= (select |v_#valid_176| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) 1) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45| 4) (select |v_#length_133| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_44| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| 1)) (<= 0 .cse1) (= (store |v_#memory_int_101| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45| (store (select |v_#memory_int_101| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_29|)) |v_#memory_int_100|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_101|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_44|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_100|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~post35#1] 8580#[L154-6]don't care [970] L154-6-->L138-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre28#1_23|))) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre28#1_23|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_127| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| v_~X_0~0.offset_54) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| v_~X_0~0.base_54) (= (select |v_#valid_170| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_170|, #memory_int=|v_#memory_int_95|, #length=|v_#length_127|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, ULTIMATE.start_main_#t~ret27#1.offset=|v_ULTIMATE.start_main_#t~ret27#1.offset_25|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ~X_0~0.base=v_~X_0~0.base_54, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret27#1.base=|v_ULTIMATE.start_main_#t~ret27#1.base_25|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_170|, #memory_int=|v_#memory_int_94|, #length=|v_#length_127|, ~X_0~0.offset=v_~X_0~0.offset_54} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret27#1.offset, #memory_int, ULTIMATE.start_main_#t~pre28#1, ~X_0~0.offset, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret27#1.base] 9532#[L138-3]don't care [800] L138-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar3_2 0) (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre28#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= v_thread1Thread1of1ForFork0_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_6|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~#t2~0.base=|v_thread1Thread1of1ForFork0_~#t2~0.base_12|, thread1Thread1of1ForFork0_thidvar2=v_thread1Thread1of1ForFork0_thidvar2_2, thread1Thread1of1ForFork0_thidvar3=v_thread1Thread1of1ForFork0_thidvar3_2, thread1Thread1of1ForFork0_~#t2~0.offset=|v_thread1Thread1of1ForFork0_~#t2~0.offset_10|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_6|, thread1Thread1of1ForFork0_#t~pre11=|v_thread1Thread1of1ForFork0_#t~pre11_8|, thread1Thread1of1ForFork0_#t~mem13=|v_thread1Thread1of1ForFork0_#t~mem13_6|, thread1Thread1of1ForFork0_~#t3~0.base=|v_thread1Thread1of1ForFork0_~#t3~0.base_12|, thread1Thread1of1ForFork0_#t~mem14=|v_thread1Thread1of1ForFork0_#t~mem14_6|, thread1Thread1of1ForFork0_#t~nondet10=|v_thread1Thread1of1ForFork0_#t~nondet10_4|, thread1Thread1of1ForFork0_~#t3~0.offset=|v_thread1Thread1of1ForFork0_~#t3~0.offset_10|, thread1Thread1of1ForFork0_#t~nondet12=|v_thread1Thread1of1ForFork0_#t~nondet12_4|, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~#t2~0.base, thread1Thread1of1ForFork0_thidvar2, thread1Thread1of1ForFork0_thidvar3, thread1Thread1of1ForFork0_~#t2~0.offset, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~pre11, thread1Thread1of1ForFork0_#t~mem13, thread1Thread1of1ForFork0_~#t3~0.base, thread1Thread1of1ForFork0_#t~mem14, thread1Thread1of1ForFork0_#t~nondet10, thread1Thread1of1ForFork0_~#t3~0.offset, thread1Thread1of1ForFork0_#t~nondet12, thread1Thread1of1ForFork0_#t~pre9] 9530#[thread1ENTRY, L138-4]don't care [740] thread1ENTRY-->L84: Formula: (and (= (store |v_#valid_2| |v_thread1Thread1of1ForFork0_~#t2~0.base_1| 1) |v_#valid_1|) (= |v_thread1Thread1of1ForFork0_~#t2~0.offset_1| 0) (= (store |v_#length_2| |v_thread1Thread1of1ForFork0_~#t2~0.base_1| 4) |v_#length_1|) (< |v_#StackHeapBarrier_1| |v_thread1Thread1of1ForFork0_~#t2~0.base_1|) (= (select |v_#valid_2| |v_thread1Thread1of1ForFork0_~#t2~0.base_1|) 0) (not (= |v_thread1Thread1of1ForFork0_~#t2~0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thread1Thread1of1ForFork0_~#t2~0.offset=|v_thread1Thread1of1ForFork0_~#t2~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thread1Thread1of1ForFork0_~#t2~0.base=|v_thread1Thread1of1ForFork0_~#t2~0.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~#t2~0.base, #valid, thread1Thread1of1ForFork0_~#t2~0.offset, #length] 9526#[L138-4, L84]don't care [741] L84-->L84-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_thread1Thread1of1ForFork0_~#t3~0.base_1|) (= |v_#length_3| (store |v_#length_4| |v_thread1Thread1of1ForFork0_~#t3~0.base_1| 4)) (= (select |v_#valid_4| |v_thread1Thread1of1ForFork0_~#t3~0.base_1|) 0) (= |v_thread1Thread1of1ForFork0_~#t3~0.offset_1| 0) (not (= |v_thread1Thread1of1ForFork0_~#t3~0.base_1| 0)) (= |v_#valid_3| (store |v_#valid_4| |v_thread1Thread1of1ForFork0_~#t3~0.base_1| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{thread1Thread1of1ForFork0_~#t3~0.base=|v_thread1Thread1of1ForFork0_~#t3~0.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, thread1Thread1of1ForFork0_~#t3~0.offset=|v_thread1Thread1of1ForFork0_~#t3~0.offset_1|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~#t3~0.base, #valid, #length, thread1Thread1of1ForFork0_~#t3~0.offset] 9522#[L138-4, L84-1]don't care [877] L84-1-->L91: Formula: (and (= v_~i_3~0_112 0) (= v_~s_2~0_61 0) (= |v_#pthreadsForks_19| |v_thread1Thread1of1ForFork0_#t~pre9_13|)) InVars {#pthreadsForks=|v_#pthreadsForks_19|} OutVars{~i_3~0=v_~i_3~0_112, #pthreadsForks=|v_#pthreadsForks_19|, ~s_2~0=v_~s_2~0_61, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_13|} AuxVars[] AssignedVars[~i_3~0, ~s_2~0, thread1Thread1of1ForFork0_#t~pre9] 9518#[L138-4, L91]don't care [744] L91-->L91-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 9516#[L138-4, L91-1]don't care [745] L91-1-->L91-2: Formula: (and (<= (+ |v_thread1Thread1of1ForFork0_~#t2~0.offset_3| 4) (select |v_#length_5| |v_thread1Thread1of1ForFork0_~#t2~0.base_3|)) (= (select |v_#valid_5| |v_thread1Thread1of1ForFork0_~#t2~0.base_3|) 1) (<= 0 |v_thread1Thread1of1ForFork0_~#t2~0.offset_3|) (= (store |v_#memory_int_2| |v_thread1Thread1of1ForFork0_~#t2~0.base_3| (store (select |v_#memory_int_2| |v_thread1Thread1of1ForFork0_~#t2~0.base_3|) |v_thread1Thread1of1ForFork0_~#t2~0.offset_3| |v_thread1Thread1of1ForFork0_#t~pre9_3|)) |v_#memory_int_1|)) InVars {thread1Thread1of1ForFork0_~#t2~0.base=|v_thread1Thread1of1ForFork0_~#t2~0.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, thread1Thread1of1ForFork0_~#t2~0.offset=|v_thread1Thread1of1ForFork0_~#t2~0.offset_3|, #length=|v_#length_5|, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_3|} OutVars{thread1Thread1of1ForFork0_~#t2~0.base=|v_thread1Thread1of1ForFork0_~#t2~0.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_~#t2~0.offset=|v_thread1Thread1of1ForFork0_~#t2~0.offset_3|, #length=|v_#length_5|, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_3|} AuxVars[] AssignedVars[#memory_int] 8992#[L138-4, L91-2]don't care [812] L91-2-->L56: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~pre9_10| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_10|} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_6|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_6|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_6|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_6|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_10|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_6|, thread2Thread1of1ForFork1_#t~nondet1#1=|v_thread2Thread1of1ForFork1_#t~nondet1#1_12|, thread2Thread1of1ForFork1_#t~ret4#1=|v_thread2Thread1of1ForFork1_#t~ret4#1_6|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_10|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_6|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_6|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_6|, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_6|, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_10|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_#t~nondet1#1, thread2Thread1of1ForFork1_#t~ret4#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 8256#[L91-3, L138-4, L56]don't care [2022-07-22 12:45:54,680 INFO L750 eck$LassoCheckResult]: Loop: 8256#[L91-3, L138-4, L56]don't care [934] L56-->L53: Formula: (let ((.cse1 (* v_~i_3~0_128 4))) (let ((.cse0 (+ .cse1 v_~X_0~0.offset_48))) (and (= (+ v_~i_3~0_129 1) v_~i_3~0_128) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (= (ite (< v_~i_3~0_129 v_~n_1~0_101) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) (<= 0 .cse0) (<= (+ .cse1 v_~X_0~0.offset_48 4) (select |v_#length_103| v_~X_0~0.base_48)) (= (select |v_#valid_142| v_~X_0~0.base_48) 1) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet1#1_22| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19| 0)) (= (select (select |v_#memory_int_80| v_~X_0~0.base_48) .cse0) v_~t_4~0_33)))) InVars {~i_3~0=v_~i_3~0_129, ~n_1~0=v_~n_1~0_101, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_80|, ~X_0~0.offset=v_~X_0~0.offset_48, #length=|v_#length_103|, ~X_0~0.base=v_~X_0~0.base_48, thread2Thread1of1ForFork1_#t~nondet1#1=|v_thread2Thread1of1ForFork1_#t~nondet1#1_22|} OutVars{~i_3~0=v_~i_3~0_128, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|, ~X_0~0.base=v_~X_0~0.base_48, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|, ~t_4~0=v_~t_4~0_33, ~n_1~0=v_~n_1~0_101, #valid=|v_#valid_142|, #memory_int=|v_#memory_int_80|, thread2Thread1of1ForFork1_#t~post2#1=|v_thread2Thread1of1ForFork1_#t~post2#1_7|, ~X_0~0.offset=v_~X_0~0.offset_48, #length=|v_#length_103|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~i_3~0, ~t_4~0, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork1_#t~nondet1#1] 8260#[L91-3, L138-4, L53]don't care [776] L53-->L56: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|))) (and (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| v_~t_4~0_21) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| |v_thread2Thread1of1ForFork1_plus_~a#1_1|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= v_~s_2~0_46 |v_thread2Thread1of1ForFork1_plus_#in~a#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)) (= v_~s_2~0_45 |v_thread2Thread1of1ForFork1_plus_#res#1_1|))) InVars {~s_2~0=v_~s_2~0_46, ~t_4~0=v_~t_4~0_21} OutVars{thread2Thread1of1ForFork1_#t~ret4#1=|v_thread2Thread1of1ForFork1_#t~ret4#1_1|, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~t_4~0=v_~t_4~0_21, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_1|, ~s_2~0=v_~s_2~0_45, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_1|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret4#1, thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_plus_#res#1, ~s_2~0, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_plus_#in~b#1] 8256#[L91-3, L138-4, L56]don't care [2022-07-22 12:45:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash -527699418, now seen corresponding path program 1 times [2022-07-22 12:45:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:54,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589491359] [2022-07-22 12:45:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:54,704 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:54,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:54,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash 30691, now seen corresponding path program 2 times [2022-07-22 12:45:54,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:54,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907440246] [2022-07-22 12:45:54,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:54,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:54,733 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:54,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:54,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash -312970040, now seen corresponding path program 1 times [2022-07-22 12:45:54,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:54,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678120878] [2022-07-22 12:45:54,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:54,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:54,882 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:45:54,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:45:54,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678120878] [2022-07-22 12:45:54,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678120878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:45:54,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131830757] [2022-07-22 12:45:54,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:54,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:45:54,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:45:54,888 INFO L229 MonitoredProcess]: Starting monitored process 45 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:45:54,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-07-22 12:45:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:45:54,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 12:45:54,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:45:55,069 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:45:55,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:45:55,122 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:45:55,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131830757] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:45:55,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:45:55,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-07-22 12:45:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970633583] [2022-07-22 12:45:55,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:45:55,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:45:55,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 12:45:55,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-22 12:45:55,294 INFO L87 Difference]: Start difference. First operand 802 states and 2674 transitions. cyclomatic complexity: 2147 Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 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:45:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:45:55,726 INFO L93 Difference]: Finished difference Result 712 states and 2075 transitions. [2022-07-22 12:45:55,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 712 states and 2075 transitions. [2022-07-22 12:45:55,738 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 228 [2022-07-22 12:45:55,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 712 states to 445 states and 1406 transitions. [2022-07-22 12:45:55,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 443 [2022-07-22 12:45:55,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2022-07-22 12:45:55,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 445 states and 1406 transitions. [2022-07-22 12:45:55,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:45:55,747 INFO L220 hiAutomatonCegarLoop]: Abstraction has 445 states and 1406 transitions. [2022-07-22 12:45:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states and 1406 transitions. [2022-07-22 12:45:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2022-07-22 12:45:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 445 states have (on average 3.1595505617977526) internal successors, (1406), 444 states have internal predecessors, (1406), 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:45:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1406 transitions. [2022-07-22 12:45:55,763 INFO L242 hiAutomatonCegarLoop]: Abstraction has 445 states and 1406 transitions. [2022-07-22 12:45:55,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:45:55,764 INFO L425 stractBuchiCegarLoop]: Abstraction has 445 states and 1406 transitions. [2022-07-22 12:45:55,764 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:45:55,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 445 states and 1406 transitions. [2022-07-22 12:45:55,769 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 228 [2022-07-22 12:45:55,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:45:55,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:45:55,770 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:45:55,770 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:45:55,771 INFO L748 eck$LassoCheckResult]: Stem: 11329#[ULTIMATE.startENTRY]don't care [989] ULTIMATE.startENTRY-->L154-6: Formula: (let ((.cse2 (store |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 1))) (let ((.cse1 (select |v_#memory_int_In_1| 1)) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 1))) (and (= (store .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 1) |v_#valid_Out_6|) (= (+ v_~n_1~0_Out_2 1) |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= (select |v_#valid_In_3| 2) 1) (= 0 |v_#NULL.base_Out_2|) (= (select .cse1 1) 0) (= 48 (select .cse1 0)) (= (select .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|) 0) (= 0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|) (= (select |v_#valid_In_3| 1) 1) (= |v_#NULL.offset_Out_2| 0) (= (select |v_#valid_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) 0) (< 0 |v_#StackHeapBarrier_In_3|) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|) 1 0) 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) 0) (= |v_#length_Out_6| (store (store (store |v_#length_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2| 4) |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|))) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|) (= v_~X_0~0.offset_Out_2 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|) (= 2 (select |v_#length_In_3| 1)) (= v_~X_0~0.base_Out_2 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2| 4294967296) 1073741823) 1 0)) (not (= (ite (< v_~n_1~0_Out_2 2147483647) 1 0) 0)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2| 0) (= (select |v_#valid_In_3| 0) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6| 0) (< |v_#StackHeapBarrier_In_3| |v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| 0)) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6| |v_#StackHeapBarrier_In_3|) (= (select |v_#length_In_3| 2) 34)))) InVars {#memory_int=|v_#memory_int_In_1|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, #length=|v_#length_In_3|, #valid=|v_#valid_In_3|} OutVars{~s_6~0=v_~s_6~0_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_Out_6|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_Out_2|, ~s_2~0=v_~s_2~0_Out_2, #NULL.offset=|v_#NULL.offset_Out_2|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_Out_2|, ULTIMATE.start_main_#t~nondet22#1=|v_ULTIMATE.start_main_#t~nondet22#1_Out_2|, #length=|v_#length_Out_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_Out_6|, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_Out_2|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_Out_2|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, #StackHeapBarrier=|v_#StackHeapBarrier_In_3|, ~n_1~0=v_~n_1~0_Out_2, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_Out_2|, ~X_0~0.offset=v_~X_0~0.offset_Out_2, ~t_5~0=v_~t_5~0_Out_2, ~i_3~0=v_~i_3~0_Out_2, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_Out_6|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base_Out_6|, ULTIMATE.start_main_#t~nondet25#1=|v_ULTIMATE.start_main_#t~nondet25#1_Out_2|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_Out_2|, ~t_4~0=v_~t_4~0_Out_2, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_14|, ~t_8~0=v_~t_8~0_Out_2, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_Out_2|, ~i_7~0=v_~i_7~0_Out_2, ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_Out_2|, ULTIMATE.start_main_#t~nondet23#1=|v_ULTIMATE.start_main_#t~nondet23#1_Out_2|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_Out_2|, ULTIMATE.start_main_#t~ret27#1.offset=|v_ULTIMATE.start_main_#t~ret27#1.offset_Out_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_Out_2|, ~X_0~0.base=v_~X_0~0.base_Out_2, #NULL.base=|v_#NULL.base_Out_2|, ULTIMATE.start_main_#t~ret27#1.base=|v_ULTIMATE.start_main_#t~ret27#1.base_Out_2|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_Out_2|, #valid=|v_#valid_Out_6|, #memory_int=|v_#memory_int_In_1|, ULTIMATE.start_main_#t~nondet24#1=|v_ULTIMATE.start_main_#t~nondet24#1_Out_2|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_Out_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_Out_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset_Out_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_10|} AuxVars[] AssignedVars[~s_6~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~i_3~0, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base, ~s_2~0, ULTIMATE.start_main_#t~nondet25#1, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre30#1, ULTIMATE.start_main_#t~nondet22#1, ~t_4~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~t_8~0, #length, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~post35#1, ULTIMATE.start_main_#t~nondet26#1, ~i_7~0, ULTIMATE.start_main_#t~mem32#1, ULTIMATE.start_main_#t~nondet23#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~ret27#1.offset, ULTIMATE.start_main_#t~nondet31#1, ULTIMATE.start_main_#t~pre28#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_~#t1~0#1.base, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~ret27#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~mem33#1, ~n_1~0, ULTIMATE.start_main_#t~nondet20#1, #valid, ~X_0~0.offset, ~t_5~0, ULTIMATE.start_main_#t~nondet24#1, ULTIMATE.start_main_#t~nondet19#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 10951#[L154-6]don't care [973] L154-6-->L154-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|))) (and (= (select |v_#valid_176| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) 1) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45| 4) (select |v_#length_133| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_44| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| 1)) (<= 0 .cse1) (= (store |v_#memory_int_101| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45| (store (select |v_#memory_int_101| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_29|)) |v_#memory_int_100|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_101|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_44|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_100|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~post35#1] 10953#[L154-6]don't care [973] L154-6-->L154-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| 4))) (let ((.cse1 (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|))) (and (= (select |v_#valid_176| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) 1) (<= (+ .cse0 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45| 4) (select |v_#length_133| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_44| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45| 1)) (<= 0 .cse1) (= (store |v_#memory_int_101| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45| (store (select |v_#memory_int_101| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_29|)) |v_#memory_int_100|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_45|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_101|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_44|, #valid=|v_#valid_176|, #memory_int=|v_#memory_int_100|, #length=|v_#length_133|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_25|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_~i~0#1, #memory_int, ULTIMATE.start_create_fresh_int_array_#t~post35#1] 10955#[L154-6]don't care [970] L154-6-->L138-3: Formula: (and (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)) (= |v_#memory_int_94| (store |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_35| (store (select |v_#memory_int_95| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_29| |v_ULTIMATE.start_main_#t~pre28#1_23|))) (= |v_#pthreadsForks_34| |v_ULTIMATE.start_main_#t~pre28#1_23|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (select |v_#length_127| |v_ULTIMATE.start_main_~#t1~0#1.base_35|)) (= |v_#pthreadsForks_33| (+ |v_#pthreadsForks_34| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24| v_~X_0~0.offset_54) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_29|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24| v_~X_0~0.base_54) (= (select |v_#valid_170| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) 1)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, #pthreadsForks=|v_#pthreadsForks_34|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, #valid=|v_#valid_170|, #memory_int=|v_#memory_int_95|, #length=|v_#length_127|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_41|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_41|, ULTIMATE.start_create_fresh_int_array_~i~0#1=|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_40|, ULTIMATE.start_main_#t~ret27#1.offset=|v_ULTIMATE.start_main_#t~ret27#1.offset_25|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ~X_0~0.base=v_~X_0~0.base_54, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_24|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_main_#t~ret27#1.base=|v_ULTIMATE.start_main_#t~ret27#1.base_25|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_24|, #pthreadsForks=|v_#pthreadsForks_33|, #valid=|v_#valid_170|, #memory_int=|v_#memory_int_94|, #length=|v_#length_127|, ~X_0~0.offset=v_~X_0~0.offset_54} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret27#1.offset, #memory_int, ULTIMATE.start_main_#t~pre28#1, ~X_0~0.offset, ~X_0~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~ret27#1.base] 11159#[L138-3]don't care [800] L138-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar3_2 0) (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre28#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= v_thread1Thread1of1ForFork0_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_6|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_~#t2~0.base=|v_thread1Thread1of1ForFork0_~#t2~0.base_12|, thread1Thread1of1ForFork0_thidvar2=v_thread1Thread1of1ForFork0_thidvar2_2, thread1Thread1of1ForFork0_thidvar3=v_thread1Thread1of1ForFork0_thidvar3_2, thread1Thread1of1ForFork0_~#t2~0.offset=|v_thread1Thread1of1ForFork0_~#t2~0.offset_10|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_6|, thread1Thread1of1ForFork0_#t~pre11=|v_thread1Thread1of1ForFork0_#t~pre11_8|, thread1Thread1of1ForFork0_#t~mem13=|v_thread1Thread1of1ForFork0_#t~mem13_6|, thread1Thread1of1ForFork0_~#t3~0.base=|v_thread1Thread1of1ForFork0_~#t3~0.base_12|, thread1Thread1of1ForFork0_#t~mem14=|v_thread1Thread1of1ForFork0_#t~mem14_6|, thread1Thread1of1ForFork0_#t~nondet10=|v_thread1Thread1of1ForFork0_#t~nondet10_4|, thread1Thread1of1ForFork0_~#t3~0.offset=|v_thread1Thread1of1ForFork0_~#t3~0.offset_10|, thread1Thread1of1ForFork0_#t~nondet12=|v_thread1Thread1of1ForFork0_#t~nondet12_4|, thread1Thread1of1ForFork0_#t~pre9=|v_thread1Thread1of1ForFork0_#t~pre9_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_~#t2~0.base, thread1Thread1of1ForFork0_thidvar2, thread1Thread1of1ForFork0_thidvar3, thread1Thread1of1ForFork0_~#t2~0.offset, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~pre11, thread1Thread1of1ForFork0_#t~mem13, thread1Thread1of1ForFork0_~#t3~0.base, thread1Thread1of1ForFork0_#t~mem14, thread1Thread1of1ForFork0_#t~nondet10, thread1Thread1of1ForFork0_~#t3~0.offset, thread1Thread1of1ForFork0_#t~nondet12, thread1Thread1of1ForFork0_#t~pre9] 10661#[thread1ENTRY, L138-4]don't care [937] L138-4-->L139-1: Formula: (= |v_#pthreadsForks_27| |v_ULTIMATE.start_main_#t~pre30#1_17|) InVars {#pthreadsForks=|v_#pthreadsForks_27|} OutVars{#pthreadsForks=|v_#pthreadsForks_27|, ULTIMATE.start_main_#t~pre28#1=|v_ULTIMATE.start_main_#t~pre28#1_17|, ULTIMATE.start_main_#t~nondet29#1=|v_ULTIMATE.start_main_#t~nondet29#1_9|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre28#1, ULTIMATE.start_main_#t~nondet29#1, ULTIMATE.start_main_#t~pre30#1] 10665#[L139-1, thread1ENTRY]don't care [574] L139-1-->L139-2: Formula: (= (+ |v_#pthreadsForks_12| 1) |v_#pthreadsForks_11|) InVars {#pthreadsForks=|v_#pthreadsForks_12|} OutVars{#pthreadsForks=|v_#pthreadsForks_11|} AuxVars[] AssignedVars[#pthreadsForks] 11323#[thread1ENTRY, L139-2]don't care [590] L139-2-->L139-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t4~0#1.offset_3| 4) (select |v_#length_22| |v_ULTIMATE.start_main_~#t4~0#1.base_3|)) (= |v_#memory_int_16| (store |v_#memory_int_17| |v_ULTIMATE.start_main_~#t4~0#1.base_3| (store (select |v_#memory_int_17| |v_ULTIMATE.start_main_~#t4~0#1.base_3|) |v_ULTIMATE.start_main_~#t4~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre30#1_3|))) (<= 0 |v_ULTIMATE.start_main_~#t4~0#1.offset_3|) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t4~0#1.base_3|) 1)) InVars {#valid=|v_#valid_27|, #memory_int=|v_#memory_int_17|, #length=|v_#length_22|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_3|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_3|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_3|} OutVars{#valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_3|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_3|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_3|} AuxVars[] AssignedVars[#memory_int] 11321#[thread1ENTRY, L139-3]don't care [806] L139-3-->thread4ENTRY: Formula: (and (= 0 v_thread4Thread1of1ForFork2_thidvar2_2) (= 0 v_thread4Thread1of1ForFork2_thidvar4_2) (= |v_ULTIMATE.start_main_#t~pre30#1_6| v_thread4Thread1of1ForFork2_thidvar0_2) (= 0 v_thread4Thread1of1ForFork2_thidvar3_2) (= 0 v_thread4Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_6|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_4|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_8|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_4|, thread4Thread1of1ForFork2_#t~nondet15#1=|v_thread4Thread1of1ForFork2_#t~nondet15#1_10|, thread4Thread1of1ForFork2_#t~mem17#1=|v_thread4Thread1of1ForFork2_#t~mem17#1_4|, thread4Thread1of1ForFork2_#t~ret18#1=|v_thread4Thread1of1ForFork2_#t~ret18#1_4|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_8|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_4|, ULTIMATE.start_main_#t~pre30#1=|v_ULTIMATE.start_main_#t~pre30#1_6|, thread4Thread1of1ForFork2_thidvar4=v_thread4Thread1of1ForFork2_thidvar4_2, thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_4|, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_4|, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_4|, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_4|, thread4Thread1of1ForFork2_#t~post16#1=|v_thread4Thread1of1ForFork2_#t~post16#1_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_#t~nondet15#1, thread4Thread1of1ForFork2_#t~mem17#1, thread4Thread1of1ForFork2_#t~ret18#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_thidvar4, thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_#res#1.offset, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post16#1] 10689#[thread4ENTRY, thread1ENTRY, L139-4]don't care [787] thread4ENTRY-->L113: Formula: (and (= v_~i_7~0_9 0) (= v_~s_6~0_7 0)) InVars {} OutVars{~s_6~0=v_~s_6~0_7, ~i_7~0=v_~i_7~0_9} AuxVars[] AssignedVars[~s_6~0, ~i_7~0] 10691#[L113, thread1ENTRY, L139-4]don't care [2022-07-22 12:45:55,772 INFO L750 eck$LassoCheckResult]: Loop: 10691#[L113, thread1ENTRY, L139-4]don't care [927] L113-->L113: Formula: (let ((.cse1 (* v_~i_7~0_63 4))) (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_7| |v_thread4Thread1of1ForFork2_plus_~b#1_7|)) (.cse2 (+ .cse1 v_~X_0~0.offset_44))) (and (= (select |v_#valid_132| v_~X_0~0.base_44) 1) (= (+ v_~i_7~0_64 1) v_~i_7~0_63) (not (= (ite (< v_~i_7~0_64 v_~n_1~0_97) 1 0) 0)) (= |v_thread4Thread1of1ForFork2_plus_#res#1_7| .cse0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_7| 0)) 1 0)) (not (= (ite (or (<= 0 (+ 2147483648 |v_thread4Thread1of1ForFork2_plus_~a#1_7| |v_thread4Thread1of1ForFork2_plus_~b#1_7|)) (<= 0 |v_thread4Thread1of1ForFork2_plus_~b#1_7|)) 1 0) 0)) (<= (+ .cse1 v_~X_0~0.offset_44 4) (select |v_#length_97| v_~X_0~0.base_44)) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_7| |v_thread4Thread1of1ForFork2_plus_~b#1_7|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_7| v_~s_6~0_49) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_7| |v_thread4Thread1of1ForFork2_plus_~a#1_7|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_19| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_19| 0)) (= v_~s_6~0_50 |v_thread4Thread1of1ForFork2_plus_#in~a#1_7|) (<= 0 .cse2) (= (select (select |v_#memory_int_74| v_~X_0~0.base_44) .cse2) v_~t_8~0_29) (not (= (mod |v_thread4Thread1of1ForFork2_#t~nondet15#1_20| 256) 0)) (= v_~t_8~0_29 |v_thread4Thread1of1ForFork2_plus_#in~b#1_7|)))) InVars {~s_6~0=v_~s_6~0_50, thread4Thread1of1ForFork2_#t~nondet15#1=|v_thread4Thread1of1ForFork2_#t~nondet15#1_20|, ~n_1~0=v_~n_1~0_97, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_74|, ~X_0~0.offset=v_~X_0~0.offset_44, #length=|v_#length_97|, ~X_0~0.base=v_~X_0~0.base_44, ~i_7~0=v_~i_7~0_64} OutVars{~s_6~0=v_~s_6~0_49, thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_7|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_19|, thread4Thread1of1ForFork2_#t~mem17#1=|v_thread4Thread1of1ForFork2_#t~mem17#1_7|, thread4Thread1of1ForFork2_#t~ret18#1=|v_thread4Thread1of1ForFork2_#t~ret18#1_7|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_19|, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_7|, ~X_0~0.base=v_~X_0~0.base_44, ~n_1~0=v_~n_1~0_97, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_7|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_74|, ~t_8~0=v_~t_8~0_29, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_7|, ~X_0~0.offset=v_~X_0~0.offset_44, #length=|v_#length_97|, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_7|, thread4Thread1of1ForFork2_#t~post16#1=|v_thread4Thread1of1ForFork2_#t~post16#1_7|, ~i_7~0=v_~i_7~0_63} AuxVars[] AssignedVars[~s_6~0, thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~nondet15#1, thread4Thread1of1ForFork2_#t~mem17#1, thread4Thread1of1ForFork2_#t~ret18#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_#in~a#1, ~t_8~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post16#1, ~i_7~0] 10691#[L113, thread1ENTRY, L139-4]don't care [2022-07-22 12:45:55,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:55,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1447846220, now seen corresponding path program 2 times [2022-07-22 12:45:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:55,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873884766] [2022-07-22 12:45:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:55,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:55,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:55,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:55,809 INFO L85 PathProgramCache]: Analyzing trace with hash 958, now seen corresponding path program 3 times [2022-07-22 12:45:55,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:55,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068964244] [2022-07-22 12:45:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:55,816 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:55,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:55,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:45:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1933558933, now seen corresponding path program 2 times [2022-07-22 12:45:55,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:45:55,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216646450] [2022-07-22 12:45:55,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:45:55,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:45:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:55,846 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:45:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:45:55,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:45:57,933 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:45:57,933 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:45:57,933 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:45:57,933 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:45:57,933 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:45:57,933 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:45:57,933 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:45:57,934 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:45:57,934 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-parallel-sum-equiv.wvr.c_BEv2_Iteration6_Lasso [2022-07-22 12:45:57,934 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:45:57,934 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:45:57,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:57,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:45:57,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:57,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:45:57,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:45:57,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:45:57,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:45:58,258 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:45:58,263 INFO L158 Benchmark]: Toolchain (without parser) took 18164.89ms. Allocated memory was 153.1MB in the beginning and 235.9MB in the end (delta: 82.8MB). Free memory was 126.4MB in the beginning and 82.9MB in the end (delta: 43.6MB). Peak memory consumption was 144.0MB. Max. memory is 8.0GB. [2022-07-22 12:45:58,264 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 153.1MB. Free memory was 122.8MB in the beginning and 122.7MB in the end (delta: 86.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:45:58,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.03ms. Allocated memory is still 153.1MB. Free memory was 126.3MB in the beginning and 114.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:45:58,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.76ms. Allocated memory is still 153.1MB. Free memory was 114.7MB in the beginning and 112.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:45:58,268 INFO L158 Benchmark]: Boogie Preprocessor took 43.05ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 110.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:45:58,269 INFO L158 Benchmark]: RCFGBuilder took 912.40ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 110.7MB in the end (delta: -288.4kB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. [2022-07-22 12:45:58,269 INFO L158 Benchmark]: BuchiAutomizer took 16766.86ms. Allocated memory was 153.1MB in the beginning and 235.9MB in the end (delta: 82.8MB). Free memory was 110.7MB in the beginning and 82.9MB in the end (delta: 27.8MB). Peak memory consumption was 127.5MB. Max. memory is 8.0GB. [2022-07-22 12:45:58,273 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.20ms. Allocated memory is still 153.1MB. Free memory was 122.8MB in the beginning and 122.7MB in the end (delta: 86.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 370.03ms. Allocated memory is still 153.1MB. Free memory was 126.3MB in the beginning and 114.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.76ms. Allocated memory is still 153.1MB. Free memory was 114.7MB in the beginning and 112.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.05ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 110.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 912.40ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 110.7MB in the end (delta: -288.4kB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 16766.86ms. Allocated memory was 153.1MB in the beginning and 235.9MB in the end (delta: 82.8MB). Free memory was 110.7MB in the beginning and 82.9MB in the end (delta: 27.8MB). Peak memory consumption was 127.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 179 PlacesBefore, 49 PlacesAfterwards, 180 TransitionsBefore, 42 TransitionsAfterwards, 2612 CoEnabledTransitionPairs, 8 FixpointIterations, 98 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 10 ConcurrentYvCompositions, 8 ChoiceCompositions, 164 TotalNumberOfCompositions, 8367 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5071, positive: 4773, positive conditional: 0, positive unconditional: 4773, negative: 298, negative conditional: 0, negative unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1433, positive: 1393, positive conditional: 0, positive unconditional: 1393, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5071, positive: 3380, positive conditional: 0, positive unconditional: 3380, negative: 258, negative conditional: 0, negative unconditional: 258, unknown: 1433, unknown conditional: 0, unknown unconditional: 1433] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 174, Positive conditional cache size: 0, Positive unconditional cache size: 174, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - 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:45:58,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-07-22 12:45:58,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-07-22 12:45:58,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...