./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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-min-array.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 9abac63211b9980a3b9079d9eb140a85fbc6c5adec6517ed998cc9e140b19342 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:09:40,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:09:40,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:09:40,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:09:40,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:09:40,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:09:40,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:09:40,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:09:40,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:09:40,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:09:40,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:09:40,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:09:40,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:09:40,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:09:40,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:09:40,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:09:40,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:09:40,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:09:40,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:09:40,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:09:40,675 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:09:40,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:09:40,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:09:40,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:09:40,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:09:40,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:09:40,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:09:40,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:09:40,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:09:40,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:09:40,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:09:40,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:09:40,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:09:40,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:09:40,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:09:40,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:09:40,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:09:40,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:09:40,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:09:40,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:09:40,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:09:40,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:09:40,706 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 09:09:40,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:09:40,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:09:40,738 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:09:40,739 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:09:40,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:09:40,740 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:09:40,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:09:40,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:09:40,741 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:09:40,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:09:40,742 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 09:09:40,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:09:40,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 09:09:40,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:09:40,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:09:40,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:09:40,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:09:40,753 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 09:09:40,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:09:40,753 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:09:40,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:09:40,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:09:40,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:09:40,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:09:40,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:09:40,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:09:40,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:09:40,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:09:40,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:09:40,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:09:40,756 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:09:40,756 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:09:40,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:09:40,757 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 -> 9abac63211b9980a3b9079d9eb140a85fbc6c5adec6517ed998cc9e140b19342 [2022-07-21 09:09:41,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:09:41,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:09:41,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:09:41,113 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:09:41,114 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:09:41,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2022-07-21 09:09:41,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d337a26f/a856463b067848129966afbaacd79c40/FLAG46ef24d24 [2022-07-21 09:09:41,601 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:09:41,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2022-07-21 09:09:41,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d337a26f/a856463b067848129966afbaacd79c40/FLAG46ef24d24 [2022-07-21 09:09:41,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d337a26f/a856463b067848129966afbaacd79c40 [2022-07-21 09:09:41,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:09:41,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:09:41,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:09:41,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:09:41,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:09:41,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:09:41" (1/1) ... [2022-07-21 09:09:41,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@385adab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:41, skipping insertion in model container [2022-07-21 09:09:41,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:09:41" (1/1) ... [2022-07-21 09:09:42,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:09:42,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:09:42,198 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-min-array.wvr.c[2553,2566] [2022-07-21 09:09:42,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:09:42,252 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:09:42,292 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-min-array.wvr.c[2553,2566] [2022-07-21 09:09:42,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:09:42,321 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:09:42,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42 WrapperNode [2022-07-21 09:09:42,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:09:42,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:09:42,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:09:42,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:09:42,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42" (1/1) ... [2022-07-21 09:09:42,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42" (1/1) ... [2022-07-21 09:09:42,374 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-07-21 09:09:42,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:09:42,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:09:42,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:09:42,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:09:42,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42" (1/1) ... [2022-07-21 09:09:42,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42" (1/1) ... [2022-07-21 09:09:42,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42" (1/1) ... [2022-07-21 09:09:42,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42" (1/1) ... [2022-07-21 09:09:42,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42" (1/1) ... [2022-07-21 09:09:42,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42" (1/1) ... [2022-07-21 09:09:42,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42" (1/1) ... [2022-07-21 09:09:42,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:09:42,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:09:42,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:09:42,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:09:42,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42" (1/1) ... [2022-07-21 09:09:42,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:09:42,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:09:42,465 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-21 09:09:42,490 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-21 09:09:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:09:42,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-21 09:09:42,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-21 09:09:42,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-21 09:09:42,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-21 09:09:42,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-21 09:09:42,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-21 09:09:42,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:09:42,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:09:42,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:09:42,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-21 09:09:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-21 09:09:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:09:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:09:42,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:09:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:09:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:09:42,514 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 09:09:42,614 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:09:42,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:09:42,939 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:09:43,028 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:09:43,034 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-21 09:09:43,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:09:43 BoogieIcfgContainer [2022-07-21 09:09:43,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:09:43,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:09:43,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:09:43,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:09:43,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:09:41" (1/3) ... [2022-07-21 09:09:43,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b36d581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:09:43, skipping insertion in model container [2022-07-21 09:09:43,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:09:42" (2/3) ... [2022-07-21 09:09:43,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b36d581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:09:43, skipping insertion in model container [2022-07-21 09:09:43,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:09:43" (3/3) ... [2022-07-21 09:09:43,047 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-07-21 09:09:43,053 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 09:09:43,061 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:09:43,061 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:09:43,062 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 09:09:43,146 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-21 09:09:43,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-07-21 09:09:43,298 INFO L129 PetriNetUnfolder]: 12/150 cut-off events. [2022-07-21 09:09:43,299 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-21 09:09:43,303 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2022-07-21 09:09:43,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 153 transitions, 330 flow [2022-07-21 09:09:43,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 139 transitions, 296 flow [2022-07-21 09:09:43,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:09:43,332 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@417664a0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5aadffd2 [2022-07-21 09:09:43,332 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-21 09:09:43,369 INFO L129 PetriNetUnfolder]: 12/138 cut-off events. [2022-07-21 09:09:43,376 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-21 09:09:43,376 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:09:43,377 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] [2022-07-21 09:09:43,378 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-21 09:09:43,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:09:43,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1264132100, now seen corresponding path program 1 times [2022-07-21 09:09:43,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:09:43,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935631533] [2022-07-21 09:09:43,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:09:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:09:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:09:43,608 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-21 09:09:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:09:43,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935631533] [2022-07-21 09:09:43,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935631533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:09:43,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:09:43,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 09:09:43,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023982512] [2022-07-21 09:09:43,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:09:43,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 09:09:43,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:09:43,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 09:09:43,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 09:09:43,644 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 153 [2022-07-21 09:09:43,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 139 transitions, 296 flow. Second operand has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 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-21 09:09:43,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:09:43,648 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 153 [2022-07-21 09:09:43,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:09:43,743 INFO L129 PetriNetUnfolder]: 41/264 cut-off events. [2022-07-21 09:09:43,743 INFO L130 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-07-21 09:09:43,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 264 events. 41/264 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 708 event pairs, 15 based on Foata normal form. 42/275 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-07-21 09:09:43,754 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 9 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2022-07-21 09:09:43,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 298 flow [2022-07-21 09:09:43,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 09:09:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-21 09:09:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-07-21 09:09:43,768 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2022-07-21 09:09:43,769 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2022-07-21 09:09:43,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2022-07-21 09:09:43,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:09:43,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2022-07-21 09:09:43,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 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-21 09:09:43,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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-21 09:09:43,781 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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-21 09:09:43,783 INFO L186 Difference]: Start difference. First operand has 137 places, 139 transitions, 296 flow. Second operand 2 states and 287 transitions. [2022-07-21 09:09:43,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 298 flow [2022-07-21 09:09:43,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 286 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-21 09:09:43,791 INFO L242 Difference]: Finished difference. Result has 132 places, 127 transitions, 260 flow [2022-07-21 09:09:43,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2022-07-21 09:09:43,797 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2022-07-21 09:09:43,797 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 260 flow [2022-07-21 09:09:43,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 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-21 09:09:43,798 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:09:43,798 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] [2022-07-21 09:09:43,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:09:43,799 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-21 09:09:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:09:43,800 INFO L85 PathProgramCache]: Analyzing trace with hash 563593522, now seen corresponding path program 1 times [2022-07-21 09:09:43,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:09:43,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916114852] [2022-07-21 09:09:43,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:09:43,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:09:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:09:44,157 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-21 09:09:44,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:09:44,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916114852] [2022-07-21 09:09:44,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916114852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:09:44,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:09:44,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 09:09:44,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242574626] [2022-07-21 09:09:44,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:09:44,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 09:09:44,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:09:44,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 09:09:44,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-21 09:09:44,163 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 153 [2022-07-21 09:09:44,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 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-21 09:09:44,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:09:44,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 153 [2022-07-21 09:09:44,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:09:44,372 INFO L129 PetriNetUnfolder]: 295/678 cut-off events. [2022-07-21 09:09:44,373 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-21 09:09:44,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 678 events. 295/678 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2973 event pairs, 167 based on Foata normal form. 1/510 useless extension candidates. Maximal degree in co-relation 1134. Up to 421 conditions per place. [2022-07-21 09:09:44,380 INFO L132 encePairwiseOnDemand]: 143/153 looper letters, 44 selfloop transitions, 6 changer transitions 4/135 dead transitions. [2022-07-21 09:09:44,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 135 transitions, 384 flow [2022-07-21 09:09:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:09:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 09:09:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 807 transitions. [2022-07-21 09:09:44,386 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6593137254901961 [2022-07-21 09:09:44,386 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 807 transitions. [2022-07-21 09:09:44,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 807 transitions. [2022-07-21 09:09:44,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:09:44,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 807 transitions. [2022-07-21 09:09:44,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 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-21 09:09:44,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 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-21 09:09:44,399 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 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-21 09:09:44,400 INFO L186 Difference]: Start difference. First operand has 132 places, 127 transitions, 260 flow. Second operand 8 states and 807 transitions. [2022-07-21 09:09:44,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 135 transitions, 384 flow [2022-07-21 09:09:44,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-21 09:09:44,413 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 288 flow [2022-07-21 09:09:44,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=288, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-07-21 09:09:44,414 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-07-21 09:09:44,415 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 288 flow [2022-07-21 09:09:44,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 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-21 09:09:44,416 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:09:44,416 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] [2022-07-21 09:09:44,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 09:09:44,416 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-21 09:09:44,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:09:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1756520908, now seen corresponding path program 1 times [2022-07-21 09:09:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:09:44,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792136702] [2022-07-21 09:09:44,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:09:44,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:09:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:09:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:09:44,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:09:44,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792136702] [2022-07-21 09:09:44,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792136702] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:09:44,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025494048] [2022-07-21 09:09:44,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:09:44,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:09:44,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:09:44,531 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-21 09:09:44,562 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-21 09:09:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:09:44,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 09:09:44,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:09:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:09:44,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:09:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:09:45,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025494048] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 09:09:45,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:09:45,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-21 09:09:45,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130851366] [2022-07-21 09:09:45,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:09:45,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:09:45,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:09:45,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:09:45,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:09:45,048 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-07-21 09:09:45,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-21 09:09:45,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:09:45,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-07-21 09:09:45,050 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:09:45,216 INFO L129 PetriNetUnfolder]: 175/510 cut-off events. [2022-07-21 09:09:45,217 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-21 09:09:45,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 510 events. 175/510 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2110 event pairs, 45 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 826. Up to 137 conditions per place. [2022-07-21 09:09:45,223 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 33 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2022-07-21 09:09:45,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 386 flow [2022-07-21 09:09:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:09:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:09:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-07-21 09:09:45,226 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7759103641456583 [2022-07-21 09:09:45,226 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-07-21 09:09:45,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-07-21 09:09:45,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:09:45,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-07-21 09:09:45,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 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-21 09:09:45,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 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-21 09:09:45,232 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 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-21 09:09:45,232 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 288 flow. Second operand 7 states and 831 transitions. [2022-07-21 09:09:45,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 386 flow [2022-07-21 09:09:45,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 368 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-07-21 09:09:45,237 INFO L242 Difference]: Finished difference. Result has 139 places, 130 transitions, 303 flow [2022-07-21 09:09:45,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=303, PETRI_PLACES=139, PETRI_TRANSITIONS=130} [2022-07-21 09:09:45,239 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-07-21 09:09:45,239 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 130 transitions, 303 flow [2022-07-21 09:09:45,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-21 09:09:45,240 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:09:45,240 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] [2022-07-21 09:09:45,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 09:09:45,455 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-21 09:09:45,455 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-21 09:09:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:09:45,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1066338293, now seen corresponding path program 1 times [2022-07-21 09:09:45,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:09:45,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732812780] [2022-07-21 09:09:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:09:45,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:09:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:09:45,601 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-21 09:09:45,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:09:45,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732812780] [2022-07-21 09:09:45,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732812780] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:09:45,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963216072] [2022-07-21 09:09:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:09:45,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:09:45,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:09:45,605 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-21 09:09:45,606 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-21 09:09:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:09:45,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 09:09:45,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:09:45,856 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-21 09:09:45,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:09:46,096 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-21 09:09:46,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963216072] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 09:09:46,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 09:09:46,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-07-21 09:09:46,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062338172] [2022-07-21 09:09:46,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:09:46,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 09:09:46,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:09:46,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 09:09:46,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-07-21 09:09:46,108 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-07-21 09:09:46,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 130 transitions, 303 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 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-21 09:09:46,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:09:46,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-07-21 09:09:46,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:09:46,430 INFO L129 PetriNetUnfolder]: 599/1273 cut-off events. [2022-07-21 09:09:46,430 INFO L130 PetriNetUnfolder]: For 404/585 co-relation queries the response was YES. [2022-07-21 09:09:46,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2530 conditions, 1273 events. 599/1273 cut-off events. For 404/585 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6947 event pairs, 124 based on Foata normal form. 181/1304 useless extension candidates. Maximal degree in co-relation 2522. Up to 249 conditions per place. [2022-07-21 09:09:46,441 INFO L132 encePairwiseOnDemand]: 141/153 looper letters, 74 selfloop transitions, 19 changer transitions 0/182 dead transitions. [2022-07-21 09:09:46,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 182 transitions, 642 flow [2022-07-21 09:09:46,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 09:09:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-21 09:09:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions. [2022-07-21 09:09:46,445 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.744503862150921 [2022-07-21 09:09:46,445 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions. [2022-07-21 09:09:46,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions. [2022-07-21 09:09:46,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:09:46,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions. [2022-07-21 09:09:46,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.9090909090909) internal successors, (1253), 11 states have internal predecessors, (1253), 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-21 09:09:46,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 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-21 09:09:46,454 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 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-21 09:09:46,455 INFO L186 Difference]: Start difference. First operand has 139 places, 130 transitions, 303 flow. Second operand 11 states and 1253 transitions. [2022-07-21 09:09:46,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 182 transitions, 642 flow [2022-07-21 09:09:46,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 182 transitions, 629 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-21 09:09:46,460 INFO L242 Difference]: Finished difference. Result has 151 places, 142 transitions, 402 flow [2022-07-21 09:09:46,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=402, PETRI_PLACES=151, PETRI_TRANSITIONS=142} [2022-07-21 09:09:46,462 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 14 predicate places. [2022-07-21 09:09:46,462 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 142 transitions, 402 flow [2022-07-21 09:09:46,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 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-21 09:09:46,463 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:09:46,463 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] [2022-07-21 09:09:46,492 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-21 09:09:46,677 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-21 09:09:46,677 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-21 09:09:46,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:09:46,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339177, now seen corresponding path program 2 times [2022-07-21 09:09:46,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:09:46,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438267519] [2022-07-21 09:09:46,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:09:46,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:09:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:09:46,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-21 09:09:46,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:09:46,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438267519] [2022-07-21 09:09:46,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438267519] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:09:46,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868378942] [2022-07-21 09:09:46,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:09:46,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:09:46,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:09:46,811 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-21 09:09:46,827 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-21 09:09:46,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 09:09:46,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:09:46,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 09:09:46,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:09:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 09:09:47,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 09:09:47,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868378942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:09:47,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 09:09:47,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-21 09:09:47,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42375326] [2022-07-21 09:09:47,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:09:47,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:09:47,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:09:47,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:09:47,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:09:47,142 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2022-07-21 09:09:47,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 142 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-21 09:09:47,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:09:47,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2022-07-21 09:09:47,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:09:47,396 INFO L129 PetriNetUnfolder]: 413/833 cut-off events. [2022-07-21 09:09:47,396 INFO L130 PetriNetUnfolder]: For 772/877 co-relation queries the response was YES. [2022-07-21 09:09:47,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 833 events. 413/833 cut-off events. For 772/877 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3721 event pairs, 111 based on Foata normal form. 131/942 useless extension candidates. Maximal degree in co-relation 2149. Up to 334 conditions per place. [2022-07-21 09:09:47,404 INFO L132 encePairwiseOnDemand]: 144/153 looper letters, 42 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2022-07-21 09:09:47,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 144 transitions, 501 flow [2022-07-21 09:09:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:09:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 09:09:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 857 transitions. [2022-07-21 09:09:47,408 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7001633986928104 [2022-07-21 09:09:47,408 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 857 transitions. [2022-07-21 09:09:47,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 857 transitions. [2022-07-21 09:09:47,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:09:47,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 857 transitions. [2022-07-21 09:09:47,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 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-21 09:09:47,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 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-21 09:09:47,413 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 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-21 09:09:47,413 INFO L186 Difference]: Start difference. First operand has 151 places, 142 transitions, 402 flow. Second operand 8 states and 857 transitions. [2022-07-21 09:09:47,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 144 transitions, 501 flow [2022-07-21 09:09:47,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 144 transitions, 488 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-07-21 09:09:47,424 INFO L242 Difference]: Finished difference. Result has 150 places, 136 transitions, 379 flow [2022-07-21 09:09:47,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=379, PETRI_PLACES=150, PETRI_TRANSITIONS=136} [2022-07-21 09:09:47,427 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 13 predicate places. [2022-07-21 09:09:47,427 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 136 transitions, 379 flow [2022-07-21 09:09:47,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 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-21 09:09:47,428 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:09:47,428 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] [2022-07-21 09:09:47,458 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-21 09:09:47,647 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-21 09:09:47,648 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-21 09:09:47,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:09:47,648 INFO L85 PathProgramCache]: Analyzing trace with hash 166796212, now seen corresponding path program 1 times [2022-07-21 09:09:47,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:09:47,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897863904] [2022-07-21 09:09:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:09:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:09:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:09:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:09:48,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:09:48,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897863904] [2022-07-21 09:09:48,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897863904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:09:48,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190891286] [2022-07-21 09:09:48,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:09:48,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:09:48,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:09:48,432 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-21 09:09:48,436 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-21 09:09:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:09:48,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-21 09:09:48,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:09:49,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 09:09:49,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:09:49,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 36 [2022-07-21 09:09:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:09:49,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:09:50,220 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:09:50,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 51 [2022-07-21 09:09:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:09:50,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190891286] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:09:50,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:09:50,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 18] total 57 [2022-07-21 09:09:50,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540724799] [2022-07-21 09:09:50,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:09:50,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-21 09:09:50,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:09:50,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-21 09:09:50,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=2720, Unknown=0, NotChecked=0, Total=3192 [2022-07-21 09:09:50,876 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 153 [2022-07-21 09:09:50,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 136 transitions, 379 flow. Second operand has 57 states, 57 states have (on average 71.28070175438596) internal successors, (4063), 57 states have internal predecessors, (4063), 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-21 09:09:50,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:09:50,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 153 [2022-07-21 09:09:50,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:09:54,736 INFO L129 PetriNetUnfolder]: 4198/6888 cut-off events. [2022-07-21 09:09:54,736 INFO L130 PetriNetUnfolder]: For 5982/5997 co-relation queries the response was YES. [2022-07-21 09:09:54,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17926 conditions, 6888 events. 4198/6888 cut-off events. For 5982/5997 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 44818 event pairs, 387 based on Foata normal form. 2/6730 useless extension candidates. Maximal degree in co-relation 17914. Up to 2296 conditions per place. [2022-07-21 09:09:54,797 INFO L132 encePairwiseOnDemand]: 113/153 looper letters, 266 selfloop transitions, 104 changer transitions 10/436 dead transitions. [2022-07-21 09:09:54,797 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 436 transitions, 2224 flow [2022-07-21 09:09:54,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-21 09:09:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-07-21 09:09:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3548 transitions. [2022-07-21 09:09:54,806 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.49339452092893893 [2022-07-21 09:09:54,806 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3548 transitions. [2022-07-21 09:09:54,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3548 transitions. [2022-07-21 09:09:54,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:09:54,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3548 transitions. [2022-07-21 09:09:54,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 75.48936170212765) internal successors, (3548), 47 states have internal predecessors, (3548), 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-21 09:09:54,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 153.0) internal successors, (7344), 48 states have internal predecessors, (7344), 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-21 09:09:54,834 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 153.0) internal successors, (7344), 48 states have internal predecessors, (7344), 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-21 09:09:54,834 INFO L186 Difference]: Start difference. First operand has 150 places, 136 transitions, 379 flow. Second operand 47 states and 3548 transitions. [2022-07-21 09:09:54,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 436 transitions, 2224 flow [2022-07-21 09:09:54,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 436 transitions, 2174 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-21 09:09:54,918 INFO L242 Difference]: Finished difference. Result has 220 places, 229 transitions, 1139 flow [2022-07-21 09:09:54,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=1139, PETRI_PLACES=220, PETRI_TRANSITIONS=229} [2022-07-21 09:09:54,920 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 83 predicate places. [2022-07-21 09:09:54,920 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 229 transitions, 1139 flow [2022-07-21 09:09:54,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 71.28070175438596) internal successors, (4063), 57 states have internal predecessors, (4063), 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-21 09:09:54,922 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:09:54,922 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] [2022-07-21 09:09:54,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 09:09:55,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:09:55,150 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:09:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:09:55,150 INFO L85 PathProgramCache]: Analyzing trace with hash 934935682, now seen corresponding path program 2 times [2022-07-21 09:09:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:09:55,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882403307] [2022-07-21 09:09:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:09:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:09:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:09:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:09:55,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:09:55,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882403307] [2022-07-21 09:09:55,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882403307] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:09:55,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615774016] [2022-07-21 09:09:55,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 09:09:55,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:09:55,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:09:55,977 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:09:55,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 09:09:56,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:09:56,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:09:56,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 09:09:56,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:09:56,622 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:09:56,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2022-07-21 09:09:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:09:57,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:09:57,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:09:57,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 51 [2022-07-21 09:09:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:09:57,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615774016] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:09:57,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:09:57,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 16] total 44 [2022-07-21 09:09:57,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509434071] [2022-07-21 09:09:57,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:09:57,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-21 09:09:57,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:09:57,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-21 09:09:57,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2022-07-21 09:09:57,988 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2022-07-21 09:09:57,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 229 transitions, 1139 flow. Second operand has 44 states, 44 states have (on average 69.1590909090909) internal successors, (3043), 44 states have internal predecessors, (3043), 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-21 09:09:57,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:09:57,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2022-07-21 09:09:57,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:10:04,946 INFO L129 PetriNetUnfolder]: 8669/14527 cut-off events. [2022-07-21 09:10:04,946 INFO L130 PetriNetUnfolder]: For 29571/29633 co-relation queries the response was YES. [2022-07-21 09:10:05,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46068 conditions, 14527 events. 8669/14527 cut-off events. For 29571/29633 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 109060 event pairs, 1235 based on Foata normal form. 12/14420 useless extension candidates. Maximal degree in co-relation 46028. Up to 5999 conditions per place. [2022-07-21 09:10:05,243 INFO L132 encePairwiseOnDemand]: 118/153 looper letters, 500 selfloop transitions, 222 changer transitions 21/795 dead transitions. [2022-07-21 09:10:05,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 795 transitions, 5369 flow [2022-07-21 09:10:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-21 09:10:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-07-21 09:10:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 4957 transitions. [2022-07-21 09:10:05,264 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.48356257926055995 [2022-07-21 09:10:05,265 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 4957 transitions. [2022-07-21 09:10:05,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 4957 transitions. [2022-07-21 09:10:05,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:10:05,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 4957 transitions. [2022-07-21 09:10:05,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 68 states, 67 states have (on average 73.98507462686567) internal successors, (4957), 67 states have internal predecessors, (4957), 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-21 09:10:05,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 68 states, 68 states have (on average 153.0) internal successors, (10404), 68 states have internal predecessors, (10404), 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-21 09:10:05,304 INFO L81 ComplementDD]: Finished complementDD. Result has 68 states, 68 states have (on average 153.0) internal successors, (10404), 68 states have internal predecessors, (10404), 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-21 09:10:05,304 INFO L186 Difference]: Start difference. First operand has 220 places, 229 transitions, 1139 flow. Second operand 67 states and 4957 transitions. [2022-07-21 09:10:05,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 795 transitions, 5369 flow [2022-07-21 09:10:05,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 795 transitions, 5303 flow, removed 22 selfloop flow, removed 14 redundant places. [2022-07-21 09:10:05,524 INFO L242 Difference]: Finished difference. Result has 305 places, 407 transitions, 3103 flow [2022-07-21 09:10:05,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=3103, PETRI_PLACES=305, PETRI_TRANSITIONS=407} [2022-07-21 09:10:05,525 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 168 predicate places. [2022-07-21 09:10:05,526 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 407 transitions, 3103 flow [2022-07-21 09:10:05,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 69.1590909090909) internal successors, (3043), 44 states have internal predecessors, (3043), 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-21 09:10:05,539 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:10:05,540 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] [2022-07-21 09:10:05,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-21 09:10:05,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:10:05,754 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:10:05,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:10:05,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1096212486, now seen corresponding path program 3 times [2022-07-21 09:10:05,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:10:05,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005812244] [2022-07-21 09:10:05,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:10:05,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:10:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:10:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:10:06,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:10:06,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005812244] [2022-07-21 09:10:06,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005812244] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:10:06,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96934205] [2022-07-21 09:10:06,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 09:10:06,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:10:06,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:10:06,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:10:06,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 09:10:06,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-21 09:10:06,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:10:06,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 09:10:06,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:10:06,756 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-21 09:10:06,796 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 09:10:06,796 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 14 [2022-07-21 09:10:07,044 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-21 09:10:07,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 09:10:07,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 09:10:07,687 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-21 09:10:07,798 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-21 09:10:08,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-07-21 09:10:08,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 09:10:08,533 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:10:08,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 36 [2022-07-21 09:10:08,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:10:08,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:10:08,857 WARN L833 $PredicateComparison]: unable to prove that (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0))))) is different from false [2022-07-21 09:10:10,592 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset))) (or (not (< .cse0 c_~min1~0)) (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse1 c_~min2~0)) (= .cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset)))))) (or (= c_~min2~0 .cse0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))))))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset) c_~min1~0) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse3 c_~min2~0)) (= c_~min1~0 .cse3)))))))) (< 1 c_~N~0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2022-07-21 09:10:10,662 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset))) (or (not (< .cse0 c_~min1~0)) (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse1 c_~min2~0)) (= .cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset)))))) (or (= c_~min2~0 .cse0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))))))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset) c_~min1~0) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse3 c_~min2~0)) (= c_~min1~0 .cse3)))))))) (< 1 c_~N~0) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-07-21 09:10:11,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse0) (not (< .cse0 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0)))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset) c_~min1~0))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) c_~A~0.base) c_~A~0.offset))) (or (not (< .cse1 c_~min1~0)) (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse2 c_~min2~0)) (= (select (select .cse3 c_~A~0.base) c_~A~0.offset) .cse2))))) (or (= c_~min2~0 .cse1) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0)))))))) (< ~M~0 0) (<= 1 ~M~0))) is different from false [2022-07-21 09:10:12,413 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (< ~M~0 0) (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< .cse0 c_~min2~0)) (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) (or (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0)) (= c_~min2~0 .cse2))) (not (< .cse2 c_~min1~0))))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= c_~min1~0 .cse3) (not (< .cse3 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0)))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))) (<= 1 ~M~0))) is different from false [2022-07-21 09:10:13,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (and (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= c_~min1~0 .cse0) (not (< .cse0 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0)))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse1 c_~min1~0)) (and (or (= c_~min2~0 .cse1) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (not (< .cse2 c_~min2~0))))))))))) (< ~M~0 0) (<= 1 ~M~0))) is different from false [2022-07-21 09:10:13,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (< ~M~0 0) (and (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0))))))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (and (or (= c_~min2~0 .cse1) (forall ((v_ArrVal_227 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~min2~0))) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_226))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse2 c_~min2~0)) (= .cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (not (< .cse1 c_~min1~0)))))) (<= 1 ~M~0))) is different from false [2022-07-21 09:10:16,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:10:16,262 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 174 treesize of output 114 [2022-07-21 09:10:16,308 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-21 09:10:16,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5779 treesize of output 5367 [2022-07-21 09:10:16,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2816 treesize of output 2384 [2022-07-21 09:10:19,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2326 treesize of output 1942 [2022-07-21 09:10:42,146 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-21 09:10:42,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 193 [2022-07-21 09:10:42,157 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-21 09:10:42,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 177 [2022-07-21 09:10:42,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:10:42,267 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 93 [2022-07-21 09:10:42,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 09:10:42,285 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-21 09:10:42,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 564 treesize of output 512 [2022-07-21 09:10:42,297 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-21 09:10:42,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 508 treesize of output 432 [2022-07-21 09:10:42,310 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-21 09:10:42,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 382 treesize of output 346 [2022-07-21 09:10:43,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-07-21 09:10:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-21 09:10:43,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96934205] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:10:43,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:10:43,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 26] total 71 [2022-07-21 09:10:43,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946857918] [2022-07-21 09:10:43,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:10:43,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-07-21 09:10:43,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:10:43,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-07-21 09:10:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=3575, Unknown=12, NotChecked=910, Total=4970 [2022-07-21 09:10:43,649 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 153 [2022-07-21 09:10:43,652 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 407 transitions, 3103 flow. Second operand has 71 states, 71 states have (on average 56.901408450704224) internal successors, (4040), 71 states have internal predecessors, (4040), 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-21 09:10:43,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:10:43,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 153 [2022-07-21 09:10:43,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:11:13,687 INFO L129 PetriNetUnfolder]: 13106/21481 cut-off events. [2022-07-21 09:11:13,687 INFO L130 PetriNetUnfolder]: For 108335/108596 co-relation queries the response was YES. [2022-07-21 09:11:13,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92282 conditions, 21481 events. 13106/21481 cut-off events. For 108335/108596 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 170014 event pairs, 2198 based on Foata normal form. 67/21217 useless extension candidates. Maximal degree in co-relation 92209. Up to 8992 conditions per place. [2022-07-21 09:11:14,195 INFO L132 encePairwiseOnDemand]: 107/153 looper letters, 515 selfloop transitions, 348 changer transitions 10/925 dead transitions. [2022-07-21 09:11:14,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 925 transitions, 8679 flow [2022-07-21 09:11:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-21 09:11:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-07-21 09:11:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 3950 transitions. [2022-07-21 09:11:14,202 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.403390522875817 [2022-07-21 09:11:14,203 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 3950 transitions. [2022-07-21 09:11:14,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 3950 transitions. [2022-07-21 09:11:14,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:11:14,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 3950 transitions. [2022-07-21 09:11:14,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 61.71875) internal successors, (3950), 64 states have internal predecessors, (3950), 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-21 09:11:14,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 153.0) internal successors, (9945), 65 states have internal predecessors, (9945), 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-21 09:11:14,239 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 153.0) internal successors, (9945), 65 states have internal predecessors, (9945), 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-21 09:11:14,239 INFO L186 Difference]: Start difference. First operand has 305 places, 407 transitions, 3103 flow. Second operand 64 states and 3950 transitions. [2022-07-21 09:11:14,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 925 transitions, 8679 flow [2022-07-21 09:11:15,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 925 transitions, 8457 flow, removed 78 selfloop flow, removed 22 redundant places. [2022-07-21 09:11:15,531 INFO L242 Difference]: Finished difference. Result has 371 places, 636 transitions, 6498 flow [2022-07-21 09:11:15,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2943, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=6498, PETRI_PLACES=371, PETRI_TRANSITIONS=636} [2022-07-21 09:11:15,533 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 234 predicate places. [2022-07-21 09:11:15,533 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 636 transitions, 6498 flow [2022-07-21 09:11:15,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 56.901408450704224) internal successors, (4040), 71 states have internal predecessors, (4040), 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-21 09:11:15,534 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:11:15,534 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] [2022-07-21 09:11:15,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 09:11:15,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:11:15,741 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:11:15,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:11:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash -5287510, now seen corresponding path program 4 times [2022-07-21 09:11:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:11:15,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522217026] [2022-07-21 09:11:15,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:11:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:11:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:11:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:11:16,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:11:16,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522217026] [2022-07-21 09:11:16,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522217026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:11:16,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469954821] [2022-07-21 09:11:16,456 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 09:11:16,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:11:16,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:11:16,458 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:11:16,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 09:11:16,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 09:11:16,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:11:16,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 09:11:16,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:11:16,571 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-21 09:11:16,617 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 09:11:16,618 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-21 09:11:16,916 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 09:11:16,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 09:11:17,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-07-21 09:11:17,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 09:11:17,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-07-21 09:11:18,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:11:18,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-07-21 09:11:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:11:18,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:11:19,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse0 (< .cse1 c_~min2~0))) (and (or (not .cse0) (= c_~min1~0 .cse1)) (or (= c_~min2~0 c_~min1~0) .cse0)))))) is different from false [2022-07-21 09:11:19,856 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:11:19,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 493 treesize of output 437 [2022-07-21 09:11:19,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2022-07-21 09:11:19,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2022-07-21 09:11:19,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 220 [2022-07-21 09:11:19,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 196 [2022-07-21 09:11:22,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 09:11:22,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 09:11:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:11:22,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469954821] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:11:22,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:11:22,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 30] total 75 [2022-07-21 09:11:22,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753291736] [2022-07-21 09:11:22,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:11:22,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-21 09:11:22,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:11:22,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-21 09:11:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=4886, Unknown=8, NotChecked=144, Total=5550 [2022-07-21 09:11:22,540 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 153 [2022-07-21 09:11:22,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 636 transitions, 6498 flow. Second operand has 75 states, 75 states have (on average 55.626666666666665) internal successors, (4172), 75 states have internal predecessors, (4172), 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-21 09:11:22,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:11:22,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 153 [2022-07-21 09:11:22,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:11:36,802 INFO L129 PetriNetUnfolder]: 23357/39020 cut-off events. [2022-07-21 09:11:36,802 INFO L130 PetriNetUnfolder]: For 397621/397921 co-relation queries the response was YES. [2022-07-21 09:11:38,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211841 conditions, 39020 events. 23357/39020 cut-off events. For 397621/397921 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 339512 event pairs, 1323 based on Foata normal form. 62/38784 useless extension candidates. Maximal degree in co-relation 211743. Up to 7994 conditions per place. [2022-07-21 09:11:38,236 INFO L132 encePairwiseOnDemand]: 118/153 looper letters, 789 selfloop transitions, 896 changer transitions 20/1750 dead transitions. [2022-07-21 09:11:38,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 1750 transitions, 22249 flow [2022-07-21 09:11:38,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-07-21 09:11:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-07-21 09:11:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 4724 transitions. [2022-07-21 09:11:38,245 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4062607499140007 [2022-07-21 09:11:38,245 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 4724 transitions. [2022-07-21 09:11:38,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 4724 transitions. [2022-07-21 09:11:38,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:11:38,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 4724 transitions. [2022-07-21 09:11:38,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 77 states, 76 states have (on average 62.1578947368421) internal successors, (4724), 76 states have internal predecessors, (4724), 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-21 09:11:38,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 77 states, 77 states have (on average 153.0) internal successors, (11781), 77 states have internal predecessors, (11781), 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-21 09:11:38,273 INFO L81 ComplementDD]: Finished complementDD. Result has 77 states, 77 states have (on average 153.0) internal successors, (11781), 77 states have internal predecessors, (11781), 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-21 09:11:38,274 INFO L186 Difference]: Start difference. First operand has 371 places, 636 transitions, 6498 flow. Second operand 76 states and 4724 transitions. [2022-07-21 09:11:38,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 1750 transitions, 22249 flow [2022-07-21 09:11:42,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 1750 transitions, 21344 flow, removed 416 selfloop flow, removed 35 redundant places. [2022-07-21 09:11:42,795 INFO L242 Difference]: Finished difference. Result has 444 places, 1210 transitions, 17244 flow [2022-07-21 09:11:42,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=6175, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=377, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=17244, PETRI_PLACES=444, PETRI_TRANSITIONS=1210} [2022-07-21 09:11:42,796 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 307 predicate places. [2022-07-21 09:11:42,796 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 1210 transitions, 17244 flow [2022-07-21 09:11:42,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 55.626666666666665) internal successors, (4172), 75 states have internal predecessors, (4172), 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-21 09:11:42,798 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:11:42,798 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] [2022-07-21 09:11:42,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 09:11:43,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:11:43,024 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:11:43,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:11:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1877669674, now seen corresponding path program 5 times [2022-07-21 09:11:43,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:11:43,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104444312] [2022-07-21 09:11:43,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:11:43,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:11:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:11:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:11:43,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:11:43,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104444312] [2022-07-21 09:11:43,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104444312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:11:43,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793893905] [2022-07-21 09:11:43,636 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 09:11:43,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:11:43,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:11:43,638 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:11:43,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 09:11:43,724 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 09:11:43,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:11:43,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 09:11:43,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:11:44,462 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:11:44,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-07-21 09:11:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:11:44,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:11:45,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:11:45,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 51 [2022-07-21 09:11:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:11:45,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793893905] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:11:45,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:11:45,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 15] total 50 [2022-07-21 09:11:45,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040608436] [2022-07-21 09:11:45,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:11:45,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-21 09:11:45,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:11:45,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-21 09:11:45,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2127, Unknown=0, NotChecked=0, Total=2450 [2022-07-21 09:11:45,571 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2022-07-21 09:11:45,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 1210 transitions, 17244 flow. Second operand has 50 states, 50 states have (on average 68.68) internal successors, (3434), 50 states have internal predecessors, (3434), 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-21 09:11:45,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:11:45,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2022-07-21 09:11:45,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:12:10,699 INFO L129 PetriNetUnfolder]: 34281/56450 cut-off events. [2022-07-21 09:12:10,699 INFO L130 PetriNetUnfolder]: For 1016160/1016464 co-relation queries the response was YES. [2022-07-21 09:12:12,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 372537 conditions, 56450 events. 34281/56450 cut-off events. For 1016160/1016464 co-relation queries the response was YES. Maximal size of possible extension queue 3015. Compared 508405 event pairs, 5446 based on Foata normal form. 49/56064 useless extension candidates. Maximal degree in co-relation 372413. Up to 30931 conditions per place. [2022-07-21 09:12:13,029 INFO L132 encePairwiseOnDemand]: 114/153 looper letters, 1119 selfloop transitions, 2014 changer transitions 7/3192 dead transitions. [2022-07-21 09:12:13,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 3192 transitions, 52298 flow [2022-07-21 09:12:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-07-21 09:12:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2022-07-21 09:12:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 8219 transitions. [2022-07-21 09:12:13,040 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.47538897564925675 [2022-07-21 09:12:13,040 INFO L72 ComplementDD]: Start complementDD. Operand 113 states and 8219 transitions. [2022-07-21 09:12:13,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 8219 transitions. [2022-07-21 09:12:13,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:12:13,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 113 states and 8219 transitions. [2022-07-21 09:12:13,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 114 states, 113 states have (on average 72.73451327433628) internal successors, (8219), 113 states have internal predecessors, (8219), 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-21 09:12:13,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 114 states, 114 states have (on average 153.0) internal successors, (17442), 114 states have internal predecessors, (17442), 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-21 09:12:13,075 INFO L81 ComplementDD]: Finished complementDD. Result has 114 states, 114 states have (on average 153.0) internal successors, (17442), 114 states have internal predecessors, (17442), 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-21 09:12:13,076 INFO L186 Difference]: Start difference. First operand has 444 places, 1210 transitions, 17244 flow. Second operand 113 states and 8219 transitions. [2022-07-21 09:12:13,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 3192 transitions, 52298 flow [2022-07-21 09:12:38,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 3192 transitions, 49398 flow, removed 1359 selfloop flow, removed 31 redundant places. [2022-07-21 09:12:38,807 INFO L242 Difference]: Finished difference. Result has 565 places, 2751 transitions, 45406 flow [2022-07-21 09:12:38,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=16096, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=546, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=113, PETRI_FLOW=45406, PETRI_PLACES=565, PETRI_TRANSITIONS=2751} [2022-07-21 09:12:38,809 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 428 predicate places. [2022-07-21 09:12:38,809 INFO L495 AbstractCegarLoop]: Abstraction has has 565 places, 2751 transitions, 45406 flow [2022-07-21 09:12:38,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 68.68) internal successors, (3434), 50 states have internal predecessors, (3434), 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-21 09:12:38,810 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:12:38,810 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] [2022-07-21 09:12:38,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 09:12:39,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 09:12:39,024 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:12:39,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:12:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1068764752, now seen corresponding path program 6 times [2022-07-21 09:12:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:12:39,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827639628] [2022-07-21 09:12:39,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:12:39,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:12:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:12:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 09:12:39,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:12:39,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827639628] [2022-07-21 09:12:39,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827639628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 09:12:39,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412728712] [2022-07-21 09:12:39,731 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 09:12:39,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 09:12:39,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:12:39,732 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 09:12:39,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 09:12:39,815 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-21 09:12:39,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 09:12:39,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 09:12:39,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 09:12:40,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2022-07-21 09:12:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:12:40,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 09:12:40,991 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 09:12:40,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 51 [2022-07-21 09:12:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:12:41,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412728712] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 09:12:41,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 09:12:41,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 15] total 50 [2022-07-21 09:12:41,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380688228] [2022-07-21 09:12:41,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 09:12:41,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-21 09:12:41,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:12:41,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-21 09:12:41,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2142, Unknown=0, NotChecked=0, Total=2450 [2022-07-21 09:12:41,335 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2022-07-21 09:12:41,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 2751 transitions, 45406 flow. Second operand has 50 states, 50 states have (on average 68.7) internal successors, (3435), 50 states have internal predecessors, (3435), 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-21 09:12:41,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:12:41,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2022-07-21 09:12:41,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand