/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:22:36,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:22:36,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:22:36,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:22:36,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:22:36,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:22:36,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:22:36,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:22:36,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:22:36,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:22:36,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:22:36,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:22:36,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:22:36,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:22:36,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:22:36,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:22:36,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:22:36,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:22:36,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:22:36,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:22:36,278 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:22:36,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:22:36,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:22:36,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:22:36,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:22:36,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:22:36,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:22:36,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:22:36,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:22:36,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:22:36,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:22:36,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:22:36,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:22:36,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:22:36,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:22:36,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:22:36,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:22:36,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:22:36,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:22:36,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:22:36,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:22:36,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:22:36,325 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-22 12:22:36,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:22:36,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:22:36,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:22:36,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:22:36,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:22:36,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:22:36,384 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:22:36,384 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:22:36,384 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:22:36,386 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:22:36,386 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:22:36,386 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:22:36,386 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:22:36,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:22:36,387 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:22:36,387 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:22:36,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:22:36,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:22:36,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:22:36,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:22:36,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:22:36,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:22:36,389 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:22:36,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:22:36,390 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:22:36,390 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:22:36,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:22:36,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:22:36,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:22:36,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:22:36,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:22:36,395 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:22:36,395 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:22:36,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:22:36,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:22:36,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:22:36,877 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:22:36,877 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:22:36,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-07-22 12:22:36,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6bd09606/134ae188bb824a478f7068e27999e133/FLAG3106bfb25 [2022-07-22 12:22:37,610 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:22:37,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-07-22 12:22:37,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6bd09606/134ae188bb824a478f7068e27999e133/FLAG3106bfb25 [2022-07-22 12:22:37,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6bd09606/134ae188bb824a478f7068e27999e133 [2022-07-22 12:22:37,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:22:37,982 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:22:37,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:22:37,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:22:37,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:22:37,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:22:37" (1/1) ... [2022-07-22 12:22:37,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39dadde4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:37, skipping insertion in model container [2022-07-22 12:22:37,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:22:37" (1/1) ... [2022-07-22 12:22:38,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:22:38,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:22:38,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-07-22 12:22:38,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:22:38,311 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:22:38,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-07-22 12:22:38,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:22:38,405 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:22:38,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:38 WrapperNode [2022-07-22 12:22:38,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:22:38,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:22:38,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:22:38,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:22:38,419 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:22:38" (1/1) ... [2022-07-22 12:22:38,432 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:22:38" (1/1) ... [2022-07-22 12:22:38,469 INFO L137 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 185 [2022-07-22 12:22:38,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:22:38,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:22:38,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:22:38,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:22:38,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:38" (1/1) ... [2022-07-22 12:22:38,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:38" (1/1) ... [2022-07-22 12:22:38,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:38" (1/1) ... [2022-07-22 12:22:38,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:38" (1/1) ... [2022-07-22 12:22:38,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:38" (1/1) ... [2022-07-22 12:22:38,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:38" (1/1) ... [2022-07-22 12:22:38,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:38" (1/1) ... [2022-07-22 12:22:38,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:22:38,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:22:38,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:22:38,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:22:38,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:38" (1/1) ... [2022-07-22 12:22:38,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:38,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:38,577 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:22:38,588 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:22:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:22:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:22:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:22:38,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:22:38,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:22:38,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:22:38,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:22:38,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:22:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:22:38,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:22:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:22:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 12:22:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 12:22:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:22:38,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:22:38,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:22:38,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:22:38,677 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:22:38,840 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:22:38,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:22:39,251 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:22:39,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:22:39,421 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:22:39,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:22:39 BoogieIcfgContainer [2022-07-22 12:22:39,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:22:39,430 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:22:39,431 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:22:39,437 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:22:39,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:22:39,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:22:37" (1/3) ... [2022-07-22 12:22:39,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1eceb818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:22:39, skipping insertion in model container [2022-07-22 12:22:39,442 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:22:39,442 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:22:38" (2/3) ... [2022-07-22 12:22:39,443 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1eceb818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:22:39, skipping insertion in model container [2022-07-22 12:22:39,443 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:22:39,443 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:22:39" (3/3) ... [2022-07-22 12:22:39,445 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-07-22 12:22:39,632 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:22:39,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 152 transitions, 328 flow [2022-07-22 12:22:39,805 INFO L129 PetriNetUnfolder]: 12/146 cut-off events. [2022-07-22 12:22:39,806 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:22:39,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 12/146 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2022-07-22 12:22:39,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 152 transitions, 328 flow [2022-07-22 12:22:39,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 146 transitions, 310 flow [2022-07-22 12:22:39,837 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-22 12:22:39,852 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 146 transitions, 310 flow [2022-07-22 12:22:39,856 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 146 transitions, 310 flow [2022-07-22 12:22:39,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 144 places, 146 transitions, 310 flow [2022-07-22 12:22:39,890 INFO L129 PetriNetUnfolder]: 12/146 cut-off events. [2022-07-22 12:22:39,890 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:22:39,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 12/146 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2022-07-22 12:22:39,894 INFO L116 LiptonReduction]: Number of co-enabled transitions 1320 [2022-07-22 12:22:46,466 INFO L131 LiptonReduction]: Checked pairs total: 1526 [2022-07-22 12:22:46,467 INFO L133 LiptonReduction]: Total number of compositions: 145 [2022-07-22 12:22:46,504 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:22:46,504 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:22:46,505 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:22:46,506 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:22:46,506 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:22:46,506 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:22:46,507 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:22:46,507 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:22:46,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:22:46,634 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 63 [2022-07-22 12:22:46,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:22:46,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:22:46,644 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:22:46,645 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:22:46,646 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:22:46,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 106 states, but on-demand construction may add more states [2022-07-22 12:22:46,667 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 63 [2022-07-22 12:22:46,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:22:46,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:22:46,668 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:22:46,669 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:22:46,679 INFO L748 eck$LassoCheckResult]: Stem: 150#[ULTIMATE.startENTRY]don't care [728] ULTIMATE.startENTRY-->L105-6: Formula: (let ((.cse3 (store |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_59| 1)) (.cse2 (select |v_#memory_int_171| 1))) (and (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= 2 (select |v_#length_192| 1)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= |v_#NULL.offset_6| 0) (= (select |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (= (store (store (store (store |v_#length_192| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_59| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_49| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~N~0_85) (= (select |v_#valid_229| 2) 1) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| 0) (= (select |v_#valid_229| 1) 1) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_59|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= v_~A~0.base_102 0) (= v_~res1~0_83 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| |v_#StackHeapBarrier_38|) (< |v_#StackHeapBarrier_38| |v_ULTIMATE.start_main_~#t3~0#1.base_59|) (= v_~res2~0_123 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| 0)) (= |v_#valid_228| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| 1)) (= 48 (select .cse2 0)) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_39| 0) (= (select .cse2 1) 0) (= v_~A~0.offset_102 0) (< 0 |v_#StackHeapBarrier_38|) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 0) (= (select |v_#valid_229| 0) 0) (< |v_#StackHeapBarrier_38| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (< |v_#StackHeapBarrier_38| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= (select |v_#length_192| 2) 33))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_38|, #valid=|v_#valid_229|, #memory_int=|v_#memory_int_171|, #length=|v_#length_192|} OutVars{~res1~0=v_~res1~0_83, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ~A~0.base=v_~A~0.base_102, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_39|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_49|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_59|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_41|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_36|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_37|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_34|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_41|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_41|, #length=|v_#length_191|, ~res2~0=v_~res2~0_123, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ~N~0=v_~N~0_85, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_33|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_23|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_22|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_36|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_23|, #StackHeapBarrier=|v_#StackHeapBarrier_38|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_42|, ~A~0.offset=v_~A~0.offset_102, ~M~0=v_~M~0_59, #valid=|v_#valid_228|, #memory_int=|v_#memory_int_171|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_41|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #length, ~res2~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post23#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, ~M~0, #valid, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 153#[L105-6]don't care [2022-07-22 12:22:46,680 INFO L750 eck$LassoCheckResult]: Loop: 153#[L105-6]don't care [715] L105-6-->L105-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_47| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4 .cse0) (select |v_#length_165| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_46| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_47| 1)) (<= 0 .cse1) (= |v_#memory_int_147| (store |v_#memory_int_148| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_148| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_23|))) (= (select |v_#valid_198| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_47| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_198|, #memory_int=|v_#memory_int_148|, #length=|v_#length_165|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_23|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_198|, #memory_int=|v_#memory_int_147|, #length=|v_#length_165|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_46|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_21|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 153#[L105-6]don't care [2022-07-22 12:22:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:46,689 INFO L85 PathProgramCache]: Analyzing trace with hash 759, now seen corresponding path program 1 times [2022-07-22 12:22:46,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:46,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087247079] [2022-07-22 12:22:46,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:46,912 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:47,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash 746, now seen corresponding path program 1 times [2022-07-22 12:22:47,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:47,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340774276] [2022-07-22 12:22:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:47,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:47,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:47,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:47,068 INFO L85 PathProgramCache]: Analyzing trace with hash 24244, now seen corresponding path program 1 times [2022-07-22 12:22:47,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:47,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628634130] [2022-07-22 12:22:47,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:47,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:47,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:47,198 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:48,194 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:22:48,195 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:22:48,195 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:22:48,195 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:22:48,196 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:22:48,196 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:48,196 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:22:48,196 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:22:48,196 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-array-sum-alt2.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:22:48,196 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:22:48,197 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:22:48,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:48,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:49,206 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:22:49,212 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:22:49,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:49,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:49,226 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:22:49,239 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:22:49,240 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:22:49,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:49,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:49,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:49,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:49,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:49,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:49,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:49,311 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:22:49,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:49,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:49,313 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:22:49,319 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:22:49,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:49,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:49,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:49,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:49,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:49,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:49,340 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:22:49,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:49,371 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:22:49,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:49,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:49,373 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:22:49,374 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:22:49,375 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:22:49,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:49,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:49,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:49,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:49,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:49,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:49,408 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:49,444 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:22:49,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:49,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:49,446 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:22:49,448 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:22:49,448 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:22:49,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:49,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:22:49,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:49,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:49,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:49,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:22:49,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:22:49,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:49,503 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:22:49,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:49,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:49,507 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:22:49,512 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:22:49,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:49,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:49,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:49,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:49,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:49,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:49,541 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:22:49,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:49,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:22:49,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:49,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:49,581 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:22:49,592 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:22:49,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:49,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:49,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:49,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:49,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:49,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:49,608 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:22:49,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:49,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-22 12:22:49,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:49,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:49,650 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:22:49,654 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:22:49,655 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:22:49,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:49,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:49,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:49,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:49,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:49,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:49,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:49,719 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:22:49,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:49,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:49,724 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:22:49,730 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:22:49,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:49,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:49,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:49,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:49,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:49,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:49,756 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:22:49,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:49,797 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:22:49,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:49,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:49,800 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:22:49,803 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:22:49,803 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:22:49,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:49,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:49,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:49,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:49,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:49,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:49,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:49,869 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:22:49,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:49,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:49,870 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:22:49,878 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:22:49,878 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:22:49,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:49,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:49,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:49,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:49,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:49,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:49,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:49,948 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:22:49,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:49,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:49,950 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:22:49,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:22:49,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:49,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:49,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:49,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:49,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:49,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:49,980 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:22:49,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:50,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-22 12:22:50,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:50,016 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:22:50,018 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:22:50,021 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:22:50,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:50,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:50,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:50,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:50,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:50,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:50,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:50,089 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:22:50,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:50,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:50,090 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:22:50,091 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:22:50,094 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:22:50,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:50,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:50,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:50,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:50,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:50,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:50,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:50,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:22:50,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:50,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:50,132 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:22:50,133 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:22:50,134 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:22:50,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:50,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:50,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:50,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:50,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:50,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:50,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:22:50,174 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:22:50,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:50,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:50,176 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:22:50,177 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:22:50,182 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:22:50,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:22:50,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:22:50,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:22:50,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:22:50,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:22:50,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:22:50,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:22:50,264 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-22 12:22:50,264 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 12:22:50,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:50,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:22:50,276 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:22:50,315 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:22:50,316 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:22:50,333 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:22:50,334 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:22:50,334 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~i~3#1) = -1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 4*ULTIMATE.start_create_fresh_int_array_~i~3#1 Supporting invariants [] [2022-07-22 12:22:50,435 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:22:50,522 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:22:50,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:22:50,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:22:50,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:22:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:22:50,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:22:50,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:22:50,610 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:22:50,644 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:22:50,647 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 106 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:22:50,715 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 106 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 108 states and 329 transitions. Complement of second has 3 states. [2022-07-22 12:22:50,717 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:22:50,723 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:22:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:22:50,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:22:50,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:22:50,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:22:50,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:22:50,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:22:50,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:22:50,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 329 transitions. [2022-07-22 12:22:50,732 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 62 [2022-07-22 12:22:50,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 100 states and 310 transitions. [2022-07-22 12:22:50,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2022-07-22 12:22:50,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2022-07-22 12:22:50,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 310 transitions. [2022-07-22 12:22:50,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:22:50,746 INFO L220 hiAutomatonCegarLoop]: Abstraction has 100 states and 310 transitions. [2022-07-22 12:22:50,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 310 transitions. [2022-07-22 12:22:50,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-22 12:22:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 3.1) internal successors, (310), 99 states have internal predecessors, (310), 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:22:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 310 transitions. [2022-07-22 12:22:50,788 INFO L242 hiAutomatonCegarLoop]: Abstraction has 100 states and 310 transitions. [2022-07-22 12:22:50,788 INFO L425 stractBuchiCegarLoop]: Abstraction has 100 states and 310 transitions. [2022-07-22 12:22:50,788 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:22:50,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 310 transitions. [2022-07-22 12:22:50,791 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 62 [2022-07-22 12:22:50,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:22:50,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:22:50,792 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:22:50,792 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:22:50,793 INFO L748 eck$LassoCheckResult]: Stem: 773#[ULTIMATE.startENTRY]don't care [728] ULTIMATE.startENTRY-->L105-6: Formula: (let ((.cse3 (store |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_59| 1)) (.cse2 (select |v_#memory_int_171| 1))) (and (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= 2 (select |v_#length_192| 1)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= |v_#NULL.offset_6| 0) (= (select |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (= (store (store (store (store |v_#length_192| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_59| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_49| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~N~0_85) (= (select |v_#valid_229| 2) 1) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| 0) (= (select |v_#valid_229| 1) 1) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_59|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= v_~A~0.base_102 0) (= v_~res1~0_83 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| |v_#StackHeapBarrier_38|) (< |v_#StackHeapBarrier_38| |v_ULTIMATE.start_main_~#t3~0#1.base_59|) (= v_~res2~0_123 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| 0)) (= |v_#valid_228| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| 1)) (= 48 (select .cse2 0)) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_39| 0) (= (select .cse2 1) 0) (= v_~A~0.offset_102 0) (< 0 |v_#StackHeapBarrier_38|) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 0) (= (select |v_#valid_229| 0) 0) (< |v_#StackHeapBarrier_38| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (< |v_#StackHeapBarrier_38| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= (select |v_#length_192| 2) 33))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_38|, #valid=|v_#valid_229|, #memory_int=|v_#memory_int_171|, #length=|v_#length_192|} OutVars{~res1~0=v_~res1~0_83, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ~A~0.base=v_~A~0.base_102, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_39|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_49|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_59|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_41|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_36|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_37|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_34|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_41|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_41|, #length=|v_#length_191|, ~res2~0=v_~res2~0_123, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ~N~0=v_~N~0_85, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_33|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_23|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_22|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_36|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_23|, #StackHeapBarrier=|v_#StackHeapBarrier_38|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_42|, ~A~0.offset=v_~A~0.offset_102, ~M~0=v_~M~0_59, #valid=|v_#valid_228|, #memory_int=|v_#memory_int_171|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_41|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #length, ~res2~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post23#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, ~M~0, #valid, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 605#[L105-6]don't care [723] L105-6-->L87-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~A~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= v_~A~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= (ite (and (<= v_~M~0_In_3 v_~N~0_In_5) (<= 0 v_~M~0_In_3)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|)) |v_#memory_int_Out_2|) (= (select |v_#valid_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ~M~0=v_~M~0_In_3, #valid=|v_#valid_In_1|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_1|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~N~0=v_~N~0_In_5, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ~M~0=v_~M~0_In_3, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_2|, #valid=|v_#valid_In_1|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_2|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre13#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 607#[L87-3]don't care [577] L87-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 599#[thread1ENTRY, L87-4]don't care [542] thread1ENTRY-->L47-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 603#[L87-4, L47-4]don't care [2022-07-22 12:22:50,793 INFO L750 eck$LassoCheckResult]: Loop: 603#[L87-4, L47-4]don't care [692] L47-4-->L47-4: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork1_~i~0#1_38| 4))) (let ((.cse1 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_15| |v_thread1Thread1of1ForFork1_plus_~b#1_15|)) (.cse0 (+ .cse2 v_~A~0.offset_74))) (and (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_15| (select (select |v_#memory_int_123| v_~A~0.base_74) .cse0)) (= |v_thread1Thread1of1ForFork1_plus_#res#1_15| .cse1) (< |v_thread1Thread1of1ForFork1_~i~0#1_38| v_~N~0_51) (<= (+ .cse2 v_~A~0.offset_74 4) (select |v_#length_131| v_~A~0.base_74)) (= (select |v_#valid_154| v_~A~0.base_74) 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_15| 0)) 1 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_37| (+ |v_thread1Thread1of1ForFork1_~i~0#1_38| 1)) (= |v_thread1Thread1of1ForFork1_plus_~a#1_15| |v_thread1Thread1of1ForFork1_plus_#in~a#1_15|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_15| v_~res1~0_61) (not (= 0 (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_15|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_15| |v_thread1Thread1of1ForFork1_plus_~b#1_15| 2147483648))) 1 0))) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_15| v_~res1~0_62) (= |v_thread1Thread1of1ForFork1_plus_~b#1_15| |v_thread1Thread1of1ForFork1_plus_#in~b#1_15|) (<= 0 .cse0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))))) InVars {~res1~0=v_~res1~0_62, ~A~0.base=v_~A~0.base_74, ~A~0.offset=v_~A~0.offset_74, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_38|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_123|, #length=|v_#length_131|, ~N~0=v_~N~0_51} OutVars{~res1~0=v_~res1~0_61, ~A~0.base=v_~A~0.base_74, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_15|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_15|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_15|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_15|, ~N~0=v_~N~0_51, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_15|, ~A~0.offset=v_~A~0.offset_74, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_37|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_123|, #length=|v_#length_131|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_15|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_15|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_15|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 603#[L87-4, L47-4]don't care [2022-07-22 12:22:50,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:50,794 INFO L85 PathProgramCache]: Analyzing trace with hash 23324601, now seen corresponding path program 1 times [2022-07-22 12:22:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:50,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906458271] [2022-07-22 12:22:50,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:50,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:50,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:50,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:50,876 INFO L85 PathProgramCache]: Analyzing trace with hash 723, now seen corresponding path program 1 times [2022-07-22 12:22:50,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:50,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14322941] [2022-07-22 12:22:50,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:50,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:50,888 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:50,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash 723063323, now seen corresponding path program 1 times [2022-07-22 12:22:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:50,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937907973] [2022-07-22 12:22:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:22:51,003 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:22:51,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:22:51,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937907973] [2022-07-22 12:22:51,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937907973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:22:51,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:22:51,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 12:22:51,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923097349] [2022-07-22 12:22:51,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:22:51,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:22:51,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 12:22:51,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 12:22:51,211 INFO L87 Difference]: Start difference. First operand 100 states and 310 transitions. cyclomatic complexity: 273 Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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:22:51,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-22 12:22:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:22:51,454 INFO L93 Difference]: Finished difference Result 197 states and 589 transitions. [2022-07-22 12:22:51,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 589 transitions. [2022-07-22 12:22:51,469 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 110 [2022-07-22 12:22:51,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 193 states and 577 transitions. [2022-07-22 12:22:51,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 192 [2022-07-22 12:22:51,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2022-07-22 12:22:51,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 577 transitions. [2022-07-22 12:22:51,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:22:51,490 INFO L220 hiAutomatonCegarLoop]: Abstraction has 193 states and 577 transitions. [2022-07-22 12:22:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 577 transitions. [2022-07-22 12:22:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 149. [2022-07-22 12:22:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 3.134228187919463) internal successors, (467), 148 states have internal predecessors, (467), 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:22:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 467 transitions. [2022-07-22 12:22:51,526 INFO L242 hiAutomatonCegarLoop]: Abstraction has 149 states and 467 transitions. [2022-07-22 12:22:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 12:22:51,527 INFO L425 stractBuchiCegarLoop]: Abstraction has 149 states and 467 transitions. [2022-07-22 12:22:51,528 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:22:51,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 467 transitions. [2022-07-22 12:22:51,533 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 86 [2022-07-22 12:22:51,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:22:51,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:22:51,534 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 12:22:51,534 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:22:51,535 INFO L748 eck$LassoCheckResult]: Stem: 1220#[ULTIMATE.startENTRY]don't care [728] ULTIMATE.startENTRY-->L105-6: Formula: (let ((.cse3 (store |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_53| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_59| 1)) (.cse2 (select |v_#memory_int_171| 1))) (and (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_66| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= 2 (select |v_#length_192| 1)) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) 1 0) 0)) (= |v_#NULL.offset_6| 0) (= (select |v_#valid_229| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) 0) (= (store (store (store (store |v_#length_192| |v_ULTIMATE.start_main_~#t1~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_53| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_59| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) |v_#length_191|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_49| 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25| v_~N~0_85) (= (select |v_#valid_229| 2) 1) (= |v_#NULL.base_6| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66| 0) (= (select |v_#valid_229| 1) 1) (= (select .cse0 |v_ULTIMATE.start_main_~#t3~0#1.base_59|) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= v_~A~0.base_102 0) (= v_~res1~0_83 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| |v_#StackHeapBarrier_38|) (< |v_#StackHeapBarrier_38| |v_ULTIMATE.start_main_~#t3~0#1.base_59|) (= v_~res2~0_123 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_45| 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| 0)) (= |v_#valid_228| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55| 1)) (= 48 (select .cse2 0)) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_39| 0) (= (select .cse2 1) 0) (= v_~A~0.offset_102 0) (< 0 |v_#StackHeapBarrier_38|) (= (select .cse3 |v_ULTIMATE.start_main_~#t2~0#1.base_53|) 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55| 0) (= (select |v_#valid_229| 0) 0) (< |v_#StackHeapBarrier_38| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) (< |v_#StackHeapBarrier_38| |v_ULTIMATE.start_main_~#t2~0#1.base_53|) (= (select |v_#length_192| 2) 33))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_38|, #valid=|v_#valid_229|, #memory_int=|v_#memory_int_171|, #length=|v_#length_192|} OutVars{~res1~0=v_~res1~0_83, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_55|, ~A~0.base=v_~A~0.base_102, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_39|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_45|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_49|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_59|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_19|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base_41|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_36|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_37|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_26|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_34|, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset_41|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_25|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_41|, #length=|v_#length_191|, ~res2~0=v_~res2~0_123, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_26|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_55|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_38|, ~N~0=v_~N~0_85, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_66|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_33|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_23|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_24|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_22|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_36|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_23|, #StackHeapBarrier=|v_#StackHeapBarrier_38|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_42|, ~A~0.offset=v_~A~0.offset_102, ~M~0=v_~M~0_59, #valid=|v_#valid_228|, #memory_int=|v_#memory_int_171|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_53|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_41|} AuxVars[] AssignedVars[~res1~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ~A~0.base, ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_#t~malloc22#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #length, ~res2~0, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ~N~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_create_fresh_int_array_#t~post23#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ~A~0.offset, ~M~0, #valid, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 1016#[L105-6]don't care [715] L105-6-->L105-6: Formula: (let ((.cse0 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_47| 4))) (let ((.cse1 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| .cse0))) (and (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 4 .cse0) (select |v_#length_165| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|)) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_46| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_47| 1)) (<= 0 .cse1) (= |v_#memory_int_147| (store |v_#memory_int_148| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (store (select |v_#memory_int_148| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) .cse1 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_23|))) (= (select |v_#valid_198| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_47| |v_ULTIMATE.start_create_fresh_int_array_~size#1_50|)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_198|, #memory_int=|v_#memory_int_148|, #length=|v_#length_165|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_47|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet24#1_23|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, #valid=|v_#valid_198|, #memory_int=|v_#memory_int_147|, #length=|v_#length_165|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_46|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_50|, ULTIMATE.start_create_fresh_int_array_#t~post23#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post23#1_21|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~nondet24#1, ULTIMATE.start_create_fresh_int_array_#t~post23#1] 1020#[L105-6]don't care [723] L105-6-->L87-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| v_~A~0.base_Out_2) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|)) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| 4) (select |v_#length_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|)) (= |v_#pthreadsForks_Out_2| (+ |v_#pthreadsForks_In_1| 1)) (= v_~A~0.offset_Out_2 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|) (= (ite (and (<= v_~M~0_In_3 v_~N~0_In_5) (<= 0 v_~M~0_In_3)) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|) (= |v_#pthreadsForks_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|) (= (store |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1| (store (select |v_#memory_int_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_In_1| |v_ULTIMATE.start_main_#t~pre13#1_Out_2|)) |v_#memory_int_Out_2|) (= (select |v_#valid_In_1| |v_ULTIMATE.start_main_~#t1~0#1.base_In_1|) 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~N~0=v_~N~0_In_5, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|, #pthreadsForks=|v_#pthreadsForks_In_1|, ~M~0=v_~M~0_In_3, #valid=|v_#valid_In_1|, #memory_int=|v_#memory_int_In_1|, #length=|v_#length_In_1|} OutVars{~A~0.base=v_~A~0.base_Out_2, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_In_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_Out_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_In_3|, ~N~0=v_~N~0_In_5, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_Out_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_In_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_In_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_In_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_In_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_Out_6|, ~A~0.offset=v_~A~0.offset_Out_2, #pthreadsForks=|v_#pthreadsForks_Out_2|, ~M~0=v_~M~0_In_3, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_6|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_Out_2|, #valid=|v_#valid_In_1|, #memory_int=|v_#memory_int_Out_2|, #length=|v_#length_In_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_6|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_Out_2|} AuxVars[] AssignedVars[~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~pre13#1, ~A~0.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] 1022#[L87-3]don't care [577] L87-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_4|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_4|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_4|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_4|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 1270#[thread1ENTRY, L87-4]don't care [542] thread1ENTRY-->L47-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 1272#[L87-4, L47-4]don't care [2022-07-22 12:22:51,536 INFO L750 eck$LassoCheckResult]: Loop: 1272#[L87-4, L47-4]don't care [692] L47-4-->L47-4: Formula: (let ((.cse2 (* |v_thread1Thread1of1ForFork1_~i~0#1_38| 4))) (let ((.cse1 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_15| |v_thread1Thread1of1ForFork1_plus_~b#1_15|)) (.cse0 (+ .cse2 v_~A~0.offset_74))) (and (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_15| (select (select |v_#memory_int_123| v_~A~0.base_74) .cse0)) (= |v_thread1Thread1of1ForFork1_plus_#res#1_15| .cse1) (< |v_thread1Thread1of1ForFork1_~i~0#1_38| v_~N~0_51) (<= (+ .cse2 v_~A~0.offset_74 4) (select |v_#length_131| v_~A~0.base_74)) (= (select |v_#valid_154| v_~A~0.base_74) 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| (ite (or (<= .cse1 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_15| 0)) 1 0)) (= |v_thread1Thread1of1ForFork1_~i~0#1_37| (+ |v_thread1Thread1of1ForFork1_~i~0#1_38| 1)) (= |v_thread1Thread1of1ForFork1_plus_~a#1_15| |v_thread1Thread1of1ForFork1_plus_#in~a#1_15|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|) (= |v_thread1Thread1of1ForFork1_plus_#res#1_15| v_~res1~0_61) (not (= 0 (ite (or (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_15|) (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_15| |v_thread1Thread1of1ForFork1_plus_~b#1_15| 2147483648))) 1 0))) (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_15| v_~res1~0_62) (= |v_thread1Thread1of1ForFork1_plus_~b#1_15| |v_thread1Thread1of1ForFork1_plus_#in~b#1_15|) (<= 0 .cse0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))))) InVars {~res1~0=v_~res1~0_62, ~A~0.base=v_~A~0.base_74, ~A~0.offset=v_~A~0.offset_74, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_38|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_123|, #length=|v_#length_131|, ~N~0=v_~N~0_51} OutVars{~res1~0=v_~res1~0_61, ~A~0.base=v_~A~0.base_74, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_15|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_15|, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_15|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_15|, ~N~0=v_~N~0_51, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_15|, ~A~0.offset=v_~A~0.offset_74, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_37|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, #valid=|v_#valid_154|, #memory_int=|v_#memory_int_123|, #length=|v_#length_131|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_15|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_15|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_15|} AuxVars[] AssignedVars[~res1~0, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_#t~mem2#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 1272#[L87-4, L47-4]don't care [2022-07-22 12:22:51,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:51,537 INFO L85 PathProgramCache]: Analyzing trace with hash 722966236, now seen corresponding path program 1 times [2022-07-22 12:22:51,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:51,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132796997] [2022-07-22 12:22:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:51,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:51,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:51,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:51,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:51,625 INFO L85 PathProgramCache]: Analyzing trace with hash 723, now seen corresponding path program 2 times [2022-07-22 12:22:51,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:51,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386524459] [2022-07-22 12:22:51,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:51,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:51,634 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:51,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:22:51,646 INFO L85 PathProgramCache]: Analyzing trace with hash 937117528, now seen corresponding path program 1 times [2022-07-22 12:22:51,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:22:51,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117183968] [2022-07-22 12:22:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:22:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:22:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:51,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:22:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:22:51,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:22:54,017 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:22:54,018 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:22:54,018 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:22:54,018 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:22:54,018 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:22:54,018 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:22:54,018 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:22:54,019 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:22:54,019 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-array-sum-alt2.wvr.c_BEv2_Iteration3_Lasso [2022-07-22 12:22:54,019 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:22:54,019 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:22:54,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:22:54,370 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:22:54,381 INFO L158 Benchmark]: Toolchain (without parser) took 16397.27ms. Allocated memory was 166.7MB in the beginning and 253.8MB in the end (delta: 87.0MB). Free memory was 139.8MB in the beginning and 219.2MB in the end (delta: -79.4MB). Peak memory consumption was 147.5MB. Max. memory is 8.0GB. [2022-07-22 12:22:54,382 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 166.7MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:22:54,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.62ms. Allocated memory is still 166.7MB. Free memory was 139.3MB in the beginning and 128.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-07-22 12:22:54,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.06ms. Allocated memory is still 166.7MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:22:54,389 INFO L158 Benchmark]: Boogie Preprocessor took 47.40ms. Allocated memory is still 166.7MB. Free memory was 126.1MB in the beginning and 124.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:22:54,390 INFO L158 Benchmark]: RCFGBuilder took 910.21ms. Allocated memory is still 166.7MB. Free memory was 124.5MB in the beginning and 95.7MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-07-22 12:22:54,394 INFO L158 Benchmark]: BuchiAutomizer took 14943.69ms. Allocated memory was 166.7MB in the beginning and 253.8MB in the end (delta: 87.0MB). Free memory was 95.3MB in the beginning and 219.2MB in the end (delta: -123.9MB). Peak memory consumption was 103.5MB. Max. memory is 8.0GB. [2022-07-22 12:22:54,397 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.30ms. Allocated memory is still 166.7MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 422.62ms. Allocated memory is still 166.7MB. Free memory was 139.3MB in the beginning and 128.2MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.06ms. Allocated memory is still 166.7MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.40ms. Allocated memory is still 166.7MB. Free memory was 126.1MB in the beginning and 124.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 910.21ms. Allocated memory is still 166.7MB. Free memory was 124.5MB in the beginning and 95.7MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 14943.69ms. Allocated memory was 166.7MB in the beginning and 253.8MB in the end (delta: 87.0MB). Free memory was 95.3MB in the beginning and 219.2MB in the end (delta: -123.9MB). Peak memory consumption was 103.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 144 PlacesBefore, 30 PlacesAfterwards, 146 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 8 FixpointIterations, 87 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 145 TotalNumberOfCompositions, 1526 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1436, positive: 1415, positive conditional: 0, positive unconditional: 1415, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 886, positive: 876, positive conditional: 0, positive unconditional: 876, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 886, positive: 876, positive conditional: 0, positive unconditional: 876, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1436, positive: 539, positive conditional: 0, positive unconditional: 539, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 886, unknown conditional: 0, unknown unconditional: 886] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - 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:22:54,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...