./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c328ca6a6071aea6db12d1e311bd2e5e22fce6c700c884e61df52925e139f834 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:32:44,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:32:44,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:32:44,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:32:44,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:32:44,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:32:44,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:32:44,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:32:44,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:32:44,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:32:44,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:32:44,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:32:44,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:32:44,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:32:44,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:32:44,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:32:44,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:32:44,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:32:44,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:32:44,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:32:44,099 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:32:44,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:32:44,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:32:44,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:32:44,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:32:44,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:32:44,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:32:44,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:32:44,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:32:44,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:32:44,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:32:44,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:32:44,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:32:44,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:32:44,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:32:44,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:32:44,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:32:44,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:32:44,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:32:44,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:32:44,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:32:44,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:32:44,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:32:44,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:32:44,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:32:44,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:32:44,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:32:44,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:32:44,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:32:44,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:32:44,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:32:44,135 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:32:44,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:32:44,136 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:32:44,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:32:44,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:32:44,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:32:44,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:32:44,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:32:44,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:32:44,137 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:32:44,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:32:44,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:32:44,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:32:44,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:32:44,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:32:44,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:32:44,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:32:44,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:32:44,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:32:44,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:32:44,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:32:44,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:32:44,140 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:32:44,140 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:32:44,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:32:44,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c328ca6a6071aea6db12d1e311bd2e5e22fce6c700c884e61df52925e139f834 [2022-07-12 10:32:44,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:32:44,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:32:44,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:32:44,357 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:32:44,357 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:32:44,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2022-07-12 10:32:44,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3fa8fd4/3e061883fcc14f23b6b43eecc561cc83/FLAG1d085eead [2022-07-12 10:32:44,752 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:32:44,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2022-07-12 10:32:44,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3fa8fd4/3e061883fcc14f23b6b43eecc561cc83/FLAG1d085eead [2022-07-12 10:32:45,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3fa8fd4/3e061883fcc14f23b6b43eecc561cc83 [2022-07-12 10:32:45,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:32:45,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:32:45,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:32:45,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:32:45,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:32:45,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635f801f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45, skipping insertion in model container [2022-07-12 10:32:45,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:32:45,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:32:45,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2022-07-12 10:32:45,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:32:45,334 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:32:45,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2022-07-12 10:32:45,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:32:45,363 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:32:45,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45 WrapperNode [2022-07-12 10:32:45,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:32:45,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:32:45,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:32:45,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:32:45,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,419 INFO L137 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 280 [2022-07-12 10:32:45,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:32:45,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:32:45,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:32:45,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:32:45,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:32:45,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:32:45,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:32:45,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:32:45,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45" (1/1) ... [2022-07-12 10:32:45,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:32:45,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:32:45,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:32:45,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:32:45,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:32:45,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:32:45,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:32:45,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:32:45,536 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:32:45,536 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:32:45,536 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:32:45,536 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:32:45,537 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-12 10:32:45,537 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-12 10:32:45,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:32:45,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:32:45,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:32:45,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:32:45,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:32:45,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:32:45,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:32:45,539 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:32:45,643 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:32:45,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:32:46,025 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:32:46,151 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:32:46,151 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 10:32:46,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:32:46 BoogieIcfgContainer [2022-07-12 10:32:46,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:32:46,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:32:46,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:32:46,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:32:46,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:32:45" (1/3) ... [2022-07-12 10:32:46,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a34dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:32:46, skipping insertion in model container [2022-07-12 10:32:46,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:32:45" (2/3) ... [2022-07-12 10:32:46,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a34dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:32:46, skipping insertion in model container [2022-07-12 10:32:46,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:32:46" (3/3) ... [2022-07-12 10:32:46,161 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2022-07-12 10:32:46,164 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:32:46,170 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:32:46,170 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:32:46,170 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:32:46,209 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-12 10:32:46,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 190 places, 196 transitions, 416 flow [2022-07-12 10:32:46,274 INFO L129 PetriNetUnfolder]: 16/193 cut-off events. [2022-07-12 10:32:46,275 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:32:46,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 193 events. 16/193 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 110 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2022-07-12 10:32:46,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 196 transitions, 416 flow [2022-07-12 10:32:46,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 182 transitions, 382 flow [2022-07-12 10:32:46,288 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:32:46,296 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a844cc8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@541b1ab [2022-07-12 10:32:46,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-12 10:32:46,333 INFO L129 PetriNetUnfolder]: 16/181 cut-off events. [2022-07-12 10:32:46,334 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:32:46,334 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:32:46,335 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:32:46,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:32:46,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:32:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash 258256848, now seen corresponding path program 1 times [2022-07-12 10:32:46,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:32:46,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983545819] [2022-07-12 10:32:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:32:46,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:32:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:32:46,600 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-12 10:32:46,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:32:46,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983545819] [2022-07-12 10:32:46,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983545819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:32:46,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:32:46,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:32:46,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667378857] [2022-07-12 10:32:46,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:32:46,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:32:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:32:46,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:32:46,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:32:46,638 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 196 [2022-07-12 10:32:46,643 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 182 transitions, 382 flow. Second operand has 2 states, 2 states have (on average 179.0) internal successors, (358), 2 states have internal predecessors, (358), 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-12 10:32:46,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:32:46,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 196 [2022-07-12 10:32:46,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:32:46,739 INFO L129 PetriNetUnfolder]: 42/316 cut-off events. [2022-07-12 10:32:46,739 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-07-12 10:32:46,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 316 events. 42/316 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 804 event pairs, 15 based on Foata normal form. 42/325 useless extension candidates. Maximal degree in co-relation 229. Up to 59 conditions per place. [2022-07-12 10:32:46,745 INFO L132 encePairwiseOnDemand]: 185/196 looper letters, 9 selfloop transitions, 0 changer transitions 6/171 dead transitions. [2022-07-12 10:32:46,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 171 transitions, 378 flow [2022-07-12 10:32:46,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:32:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:32:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 370 transitions. [2022-07-12 10:32:46,762 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9438775510204082 [2022-07-12 10:32:46,763 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 370 transitions. [2022-07-12 10:32:46,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 370 transitions. [2022-07-12 10:32:46,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:32:46,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 370 transitions. [2022-07-12 10:32:46,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 185.0) internal successors, (370), 2 states have internal predecessors, (370), 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-12 10:32:46,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 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-12 10:32:46,777 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 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-12 10:32:46,778 INFO L186 Difference]: Start difference. First operand has 176 places, 182 transitions, 382 flow. Second operand 2 states and 370 transitions. [2022-07-12 10:32:46,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 171 transitions, 378 flow [2022-07-12 10:32:46,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 171 transitions, 366 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-12 10:32:46,784 INFO L242 Difference]: Finished difference. Result has 171 places, 165 transitions, 336 flow [2022-07-12 10:32:46,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=336, PETRI_PLACES=171, PETRI_TRANSITIONS=165} [2022-07-12 10:32:46,791 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, -5 predicate places. [2022-07-12 10:32:46,791 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 165 transitions, 336 flow [2022-07-12 10:32:46,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 179.0) internal successors, (358), 2 states have internal predecessors, (358), 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-12 10:32:46,792 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:32:46,792 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:32:46,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:32:46,793 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:32:46,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:32:46,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2054653840, now seen corresponding path program 1 times [2022-07-12 10:32:46,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:32:46,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403345813] [2022-07-12 10:32:46,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:32:46,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:32:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:32:47,074 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-12 10:32:47,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:32:47,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403345813] [2022-07-12 10:32:47,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403345813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:32:47,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:32:47,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:32:47,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069434072] [2022-07-12 10:32:47,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:32:47,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:32:47,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:32:47,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:32:47,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:32:47,078 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 196 [2022-07-12 10:32:47,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 165 transitions, 336 flow. Second operand has 8 states, 8 states have (on average 120.25) internal successors, (962), 8 states have internal predecessors, (962), 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-12 10:32:47,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:32:47,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 196 [2022-07-12 10:32:47,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:32:47,317 INFO L129 PetriNetUnfolder]: 298/789 cut-off events. [2022-07-12 10:32:47,318 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-12 10:32:47,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 789 events. 298/789 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3371 event pairs, 167 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 1286. Up to 438 conditions per place. [2022-07-12 10:32:47,324 INFO L132 encePairwiseOnDemand]: 181/196 looper letters, 62 selfloop transitions, 10 changer transitions 23/196 dead transitions. [2022-07-12 10:32:47,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 196 transitions, 588 flow [2022-07-12 10:32:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:32:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:32:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1008 transitions. [2022-07-12 10:32:47,328 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-07-12 10:32:47,328 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1008 transitions. [2022-07-12 10:32:47,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1008 transitions. [2022-07-12 10:32:47,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:32:47,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1008 transitions. [2022-07-12 10:32:47,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 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-12 10:32:47,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-12 10:32:47,335 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-12 10:32:47,335 INFO L186 Difference]: Start difference. First operand has 171 places, 165 transitions, 336 flow. Second operand 8 states and 1008 transitions. [2022-07-12 10:32:47,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 196 transitions, 588 flow [2022-07-12 10:32:47,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 196 transitions, 588 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:32:47,342 INFO L242 Difference]: Finished difference. Result has 176 places, 167 transitions, 380 flow [2022-07-12 10:32:47,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=380, PETRI_PLACES=176, PETRI_TRANSITIONS=167} [2022-07-12 10:32:47,343 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 0 predicate places. [2022-07-12 10:32:47,344 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 167 transitions, 380 flow [2022-07-12 10:32:47,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.25) internal successors, (962), 8 states have internal predecessors, (962), 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-12 10:32:47,345 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:32:47,345 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:32:47,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:32:47,345 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:32:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:32:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2135143954, now seen corresponding path program 1 times [2022-07-12 10:32:47,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:32:47,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810259297] [2022-07-12 10:32:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:32:47,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:32:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:32:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:32:47,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:32:47,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810259297] [2022-07-12 10:32:47,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810259297] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:32:47,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063696509] [2022-07-12 10:32:47,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:32:47,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:32:47,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:32:47,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:32:47,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:32:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:32:47,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 10:32:47,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:32:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:32:47,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:32:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:32:48,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063696509] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:32:48,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:32:48,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-12 10:32:48,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781095799] [2022-07-12 10:32:48,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:32:48,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:32:48,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:32:48,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:32:48,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:32:48,008 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 196 [2022-07-12 10:32:48,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 167 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 146.14285714285714) internal successors, (1023), 7 states have internal predecessors, (1023), 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-12 10:32:48,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:32:48,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 196 [2022-07-12 10:32:48,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:32:48,141 INFO L129 PetriNetUnfolder]: 182/683 cut-off events. [2022-07-12 10:32:48,142 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-07-12 10:32:48,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 683 events. 182/683 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3308 event pairs, 80 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 1022. Up to 147 conditions per place. [2022-07-12 10:32:48,146 INFO L132 encePairwiseOnDemand]: 188/196 looper letters, 46 selfloop transitions, 7 changer transitions 0/175 dead transitions. [2022-07-12 10:32:48,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 175 transitions, 504 flow [2022-07-12 10:32:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:32:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:32:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1039 transitions. [2022-07-12 10:32:48,149 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7572886297376094 [2022-07-12 10:32:48,149 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1039 transitions. [2022-07-12 10:32:48,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1039 transitions. [2022-07-12 10:32:48,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:32:48,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1039 transitions. [2022-07-12 10:32:48,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 148.42857142857142) internal successors, (1039), 7 states have internal predecessors, (1039), 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-12 10:32:48,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 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-12 10:32:48,154 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 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-12 10:32:48,154 INFO L186 Difference]: Start difference. First operand has 176 places, 167 transitions, 380 flow. Second operand 7 states and 1039 transitions. [2022-07-12 10:32:48,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 175 transitions, 504 flow [2022-07-12 10:32:48,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 175 transitions, 480 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-07-12 10:32:48,160 INFO L242 Difference]: Finished difference. Result has 176 places, 169 transitions, 389 flow [2022-07-12 10:32:48,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=176, PETRI_TRANSITIONS=169} [2022-07-12 10:32:48,162 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 0 predicate places. [2022-07-12 10:32:48,162 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 169 transitions, 389 flow [2022-07-12 10:32:48,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 146.14285714285714) internal successors, (1023), 7 states have internal predecessors, (1023), 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-12 10:32:48,163 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:32:48,163 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:32:48,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 10:32:48,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:32:48,381 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:32:48,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:32:48,382 INFO L85 PathProgramCache]: Analyzing trace with hash -875219082, now seen corresponding path program 1 times [2022-07-12 10:32:48,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:32:48,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056393777] [2022-07-12 10:32:48,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:32:48,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:32:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:32:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:32:48,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:32:48,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056393777] [2022-07-12 10:32:48,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056393777] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:32:48,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423849938] [2022-07-12 10:32:48,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:32:48,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:32:48,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:32:48,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:32:48,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:32:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:32:48,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:32:48,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:32:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:32:48,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:32:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:32:49,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423849938] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:32:49,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:32:49,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-07-12 10:32:49,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344592643] [2022-07-12 10:32:49,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:32:49,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:32:49,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:32:49,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:32:49,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:32:49,015 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 196 [2022-07-12 10:32:49,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 169 transitions, 389 flow. Second operand has 9 states, 9 states have (on average 138.66666666666666) internal successors, (1248), 9 states have internal predecessors, (1248), 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-12 10:32:49,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:32:49,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 196 [2022-07-12 10:32:49,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:32:49,330 INFO L129 PetriNetUnfolder]: 875/1783 cut-off events. [2022-07-12 10:32:49,330 INFO L130 PetriNetUnfolder]: For 648/905 co-relation queries the response was YES. [2022-07-12 10:32:49,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 1783 events. 875/1783 cut-off events. For 648/905 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10354 event pairs, 253 based on Foata normal form. 257/1864 useless extension candidates. Maximal degree in co-relation 3532. Up to 445 conditions per place. [2022-07-12 10:32:49,341 INFO L132 encePairwiseOnDemand]: 185/196 looper letters, 97 selfloop transitions, 17 changer transitions 0/229 dead transitions. [2022-07-12 10:32:49,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 229 transitions, 788 flow [2022-07-12 10:32:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:32:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:32:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1581 transitions. [2022-07-12 10:32:49,344 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7333024118738405 [2022-07-12 10:32:49,344 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1581 transitions. [2022-07-12 10:32:49,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1581 transitions. [2022-07-12 10:32:49,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:32:49,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1581 transitions. [2022-07-12 10:32:49,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 143.72727272727272) internal successors, (1581), 11 states have internal predecessors, (1581), 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-12 10:32:49,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 196.0) internal successors, (2352), 12 states have internal predecessors, (2352), 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-12 10:32:49,350 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 196.0) internal successors, (2352), 12 states have internal predecessors, (2352), 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-12 10:32:49,350 INFO L186 Difference]: Start difference. First operand has 176 places, 169 transitions, 389 flow. Second operand 11 states and 1581 transitions. [2022-07-12 10:32:49,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 229 transitions, 788 flow [2022-07-12 10:32:49,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 229 transitions, 775 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:32:49,354 INFO L242 Difference]: Finished difference. Result has 186 places, 180 transitions, 469 flow [2022-07-12 10:32:49,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=469, PETRI_PLACES=186, PETRI_TRANSITIONS=180} [2022-07-12 10:32:49,355 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 10 predicate places. [2022-07-12 10:32:49,356 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 180 transitions, 469 flow [2022-07-12 10:32:49,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 138.66666666666666) internal successors, (1248), 9 states have internal predecessors, (1248), 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-12 10:32:49,356 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:32:49,356 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:32:49,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 10:32:49,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-12 10:32:49,572 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:32:49,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:32:49,572 INFO L85 PathProgramCache]: Analyzing trace with hash 164975412, now seen corresponding path program 2 times [2022-07-12 10:32:49,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:32:49,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293116281] [2022-07-12 10:32:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:32:49,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:32:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:32:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:32:49,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:32:49,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293116281] [2022-07-12 10:32:49,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293116281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:32:49,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440725874] [2022-07-12 10:32:49,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:32:49,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:32:49,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:32:49,658 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:32:49,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:32:49,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 10:32:49,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:32:49,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 10:32:49,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:32:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 10:32:49,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:32:49,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440725874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:32:49,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:32:49,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-12 10:32:49,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616776972] [2022-07-12 10:32:49,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:32:49,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:32:49,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:32:49,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:32:49,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:32:49,886 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 196 [2022-07-12 10:32:49,887 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 180 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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-12 10:32:49,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:32:49,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 196 [2022-07-12 10:32:49,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:32:50,136 INFO L129 PetriNetUnfolder]: 608/1399 cut-off events. [2022-07-12 10:32:50,137 INFO L130 PetriNetUnfolder]: For 896/1098 co-relation queries the response was YES. [2022-07-12 10:32:50,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3131 conditions, 1399 events. 608/1399 cut-off events. For 896/1098 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7873 event pairs, 181 based on Foata normal form. 234/1589 useless extension candidates. Maximal degree in co-relation 3119. Up to 535 conditions per place. [2022-07-12 10:32:50,147 INFO L132 encePairwiseOnDemand]: 187/196 looper letters, 57 selfloop transitions, 13 changer transitions 0/193 dead transitions. [2022-07-12 10:32:50,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 193 transitions, 662 flow [2022-07-12 10:32:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:32:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:32:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1098 transitions. [2022-07-12 10:32:50,150 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7002551020408163 [2022-07-12 10:32:50,150 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1098 transitions. [2022-07-12 10:32:50,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1098 transitions. [2022-07-12 10:32:50,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:32:50,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1098 transitions. [2022-07-12 10:32:50,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.25) internal successors, (1098), 8 states have internal predecessors, (1098), 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-12 10:32:50,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-12 10:32:50,154 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-12 10:32:50,154 INFO L186 Difference]: Start difference. First operand has 186 places, 180 transitions, 469 flow. Second operand 8 states and 1098 transitions. [2022-07-12 10:32:50,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 193 transitions, 662 flow [2022-07-12 10:32:50,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 193 transitions, 655 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:32:50,160 INFO L242 Difference]: Finished difference. Result has 191 places, 183 transitions, 530 flow [2022-07-12 10:32:50,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=530, PETRI_PLACES=191, PETRI_TRANSITIONS=183} [2022-07-12 10:32:50,161 INFO L279 CegarLoopForPetriNet]: 176 programPoint places, 15 predicate places. [2022-07-12 10:32:50,161 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 183 transitions, 530 flow [2022-07-12 10:32:50,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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-12 10:32:50,162 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:32:50,162 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:32:50,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 10:32:50,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:32:50,385 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:32:50,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:32:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2080790250, now seen corresponding path program 1 times [2022-07-12 10:32:50,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:32:50,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447081154] [2022-07-12 10:32:50,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:32:50,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:32:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:32:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:32:52,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:32:52,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447081154] [2022-07-12 10:32:52,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447081154] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:32:52,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762693494] [2022-07-12 10:32:52,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:32:52,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:32:52,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:32:52,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:32:52,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:32:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:32:52,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-12 10:32:52,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:32:52,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:32:52,268 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:32:52,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 10:32:52,668 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 10:32:52,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 10:32:52,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 10:32:53,729 INFO L356 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-07-12 10:32:53,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-07-12 10:32:53,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:32:54,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:32:54,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:32:54,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:32:54,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:32:54,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 98 [2022-07-12 10:32:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:32:55,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:33:05,657 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (~B~0.base Int) (v_ArrVal_201 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse2 (select .cse3 c_~A~0.base)) (.cse0 (select .cse3 ~B~0.base))) (<= (let ((.cse1 (* ~M~0 4))) (+ c_~res2~0 (select .cse0 (+ .cse1 c_~B~0.offset)) (select .cse2 (+ c_~A~0.offset .cse1)))) (+ (select .cse2 c_~A~0.offset) c_~res1~0 (select .cse0 c_~B~0.offset))))))) (forall ((~M~0 Int) (~B~0.base Int) (v_ArrVal_201 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse5 (select .cse7 ~B~0.base)) (.cse4 (select .cse7 c_~A~0.base))) (<= (+ (select .cse4 c_~A~0.offset) c_~res1~0 (select .cse5 c_~B~0.offset)) (let ((.cse6 (* ~M~0 4))) (+ c_~res2~0 (select .cse5 (+ .cse6 c_~B~0.offset)) (select .cse4 (+ c_~A~0.offset .cse6)))))))))) is different from false [2022-07-12 10:33:05,754 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse0 (select .cse3 c_~A~0.base)) (.cse1 (select .cse3 ~B~0.base))) (<= (+ (select .cse0 c_~A~0.offset) (select .cse1 c_~B~0.offset) c_~res1~0) (let ((.cse2 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse2)) c_~res2~0 (select .cse1 (+ .cse2 c_~B~0.offset))))))))) (forall ((~M~0 Int) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse4 (select .cse7 c_~A~0.base)) (.cse6 (select .cse7 ~B~0.base))) (<= (let ((.cse5 (* ~M~0 4))) (+ (select .cse4 (+ c_~A~0.offset .cse5)) c_~res2~0 (select .cse6 (+ .cse5 c_~B~0.offset)))) (+ (select .cse4 c_~A~0.offset) (select .cse6 c_~B~0.offset) c_~res1~0))))))) is different from false [2022-07-12 10:33:05,859 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse1 (select .cse3 ~B~0.base)) (.cse0 (select .cse3 c_~A~0.base))) (<= (+ (select .cse0 c_~A~0.offset) c_~res1~0 (select .cse1 c_~B~0.offset)) (let ((.cse2 (* ~M~0 4))) (+ (select .cse1 (+ .cse2 c_~B~0.offset)) c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse2))))))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse6 (select .cse7 c_~A~0.base)) (.cse4 (select .cse7 ~B~0.base))) (<= (let ((.cse5 (* ~M~0 4))) (+ (select .cse4 (+ .cse5 c_~B~0.offset)) c_~res2~0 (select .cse6 (+ c_~A~0.offset .cse5)))) (+ (select .cse6 c_~A~0.offset) c_~res1~0 (select .cse4 c_~B~0.offset)))))))) is different from false [2022-07-12 10:33:06,050 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse0 (select .cse3 c_~A~0.base)) (.cse1 (select .cse3 ~B~0.base))) (<= (+ (select .cse0 c_~A~0.offset) (select .cse1 |c_ULTIMATE.start_main_#t~ret19#1.offset|) c_~res1~0) (let ((.cse2 (* ~M~0 4))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse2)) (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_#t~ret19#1.offset|))))))))) (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse4 (select .cse7 c_~A~0.base)) (.cse6 (select .cse7 ~B~0.base))) (<= (let ((.cse5 (* ~M~0 4))) (+ c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse6 (+ .cse5 |c_ULTIMATE.start_main_#t~ret19#1.offset|)))) (+ (select .cse4 c_~A~0.offset) (select .cse6 |c_ULTIMATE.start_main_#t~ret19#1.offset|) c_~res1~0)))) (not (< ~M~0 c_~N~0))))) is different from false [2022-07-12 10:33:06,087 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse0 (select .cse3 ~B~0.base)) (.cse2 (select .cse3 c_~A~0.base))) (<= (let ((.cse1 (* ~M~0 4))) (+ c_~res2~0 (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse2 (+ c_~A~0.offset .cse1)))) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select .cse2 c_~A~0.offset) c_~res1~0)))))) (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse4 (select .cse7 ~B~0.base)) (.cse5 (select .cse7 c_~A~0.base))) (<= (+ (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select .cse5 c_~A~0.offset) c_~res1~0) (let ((.cse6 (* ~M~0 4))) (+ c_~res2~0 (select .cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse5 (+ c_~A~0.offset .cse6)))))))))) is different from false [2022-07-12 10:33:06,107 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse2 (select .cse3 c_~A~0.base)) (.cse0 (select .cse3 ~B~0.base))) (<= (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1)))) (+ (select .cse2 c_~A~0.offset) c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse5 (select .cse7 ~B~0.base)) (.cse4 (select .cse7 c_~A~0.base))) (<= (+ (select .cse4 c_~A~0.offset) c_~res1~0 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (let ((.cse6 (* ~M~0 4))) (+ (select .cse5 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse6)))))))))) is different from false [2022-07-12 10:33:06,215 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse1 (select .cse3 ~B~0.base)) (.cse0 (select .cse3 c_~A~0.base))) (<= (+ c_~res1~0 (select .cse0 c_~A~0.offset) (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (let ((.cse2 (* ~M~0 4))) (+ (select .cse1 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ c_~A~0.offset .cse2)) c_~res2~0))))))) (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse6 (select .cse7 c_~A~0.base)) (.cse4 (select .cse7 ~B~0.base))) (<= (let ((.cse5 (* ~M~0 4))) (+ (select .cse4 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse6 (+ c_~A~0.offset .cse5)) c_~res2~0)) (+ c_~res1~0 (select .cse6 c_~A~0.offset) (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) is different from false [2022-07-12 10:33:06,315 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse0 (select .cse3 c_~A~0.base)) (.cse2 (select .cse3 ~B~0.base))) (<= (let ((.cse1 (* ~M~0 4))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset| .cse1)))) (+ (select .cse0 c_~A~0.offset) (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset|) c_~res1~0)))))) (forall ((~M~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_198 (Array Int Int)) (~B~0.base Int) (v_ArrVal_201 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse7 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.base| v_ArrVal_198) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_201))) (let ((.cse4 (select .cse7 c_~A~0.base)) (.cse5 (select .cse7 ~B~0.base))) (<= (+ (select .cse4 c_~A~0.offset) (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset|) c_~res1~0) (let ((.cse6 (* ~M~0 4))) (+ c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse6)) (select .cse5 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc29#1.offset| .cse6))))))) (not (< ~M~0 c_~N~0))))) is different from false [2022-07-12 10:33:12,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:33:12,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 92 [2022-07-12 10:33:12,466 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:33:12,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2195446 treesize of output 2105412 [2022-07-12 10:33:15,805 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:33:15,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2105334 treesize of output 1646648 [2022-07-12 10:33:19,014 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:33:19,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1646582 treesize of output 1589304 [2022-07-12 10:33:22,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:33:22,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1589238 treesize of output 1474616 [2022-07-12 10:33:25,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:33:25,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1474550 treesize of output 1245240 [2022-07-12 10:33:54,430 WARN L233 SmtUtils]: Spent 19.05s on a formula simplification. DAG size of input: 668 DAG size of output: 668 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 10:34:20,328 WARN L233 SmtUtils]: Spent 22.88s on a formula simplification. DAG size of input: 666 DAG size of output: 666 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)