./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-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-?-6c24879 [2022-07-12 10:35:18,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:35:18,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:35:18,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:35:18,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:35:18,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:35:18,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:35:18,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:35:18,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:35:18,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:35:18,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:35:18,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:35:18,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:35:18,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:35:18,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:35:18,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:35:18,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:35:18,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:35:18,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:35:18,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:35:18,608 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:35:18,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:35:18,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:35:18,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:35:18,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:35:18,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:35:18,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:35:18,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:35:18,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:35:18,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:35:18,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:35:18,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:35:18,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:35:18,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:35:18,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:35:18,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:35:18,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:35:18,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:35:18,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:35:18,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:35:18,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:35:18,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:35:18,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:35:18,667 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:35:18,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:35:18,668 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:35:18,669 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:35:18,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:35:18,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:35:18,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:35:18,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:35:18,670 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:35:18,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:35:18,671 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:35:18,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:35:18,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:35:18,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:35:18,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:35:18,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:35:18,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:35:18,672 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:35:18,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:35:18,673 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:35:18,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:35:18,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:35:18,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:35:18,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:35:18,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:35:18,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:35:18,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:35:18,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:35:18,674 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:35:18,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:35:18,675 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:35:18,675 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:35:18,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:35:18,675 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-12 10:35:18,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:35:18,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:35:18,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:35:18,888 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:35:18,888 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:35:18,889 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-12 10:35:18,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/577fef5fe/64af279ae616464483978379c2e7673a/FLAG80de8c3a9 [2022-07-12 10:35:19,295 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:35:19,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2022-07-12 10:35:19,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/577fef5fe/64af279ae616464483978379c2e7673a/FLAG80de8c3a9 [2022-07-12 10:35:19,314 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/577fef5fe/64af279ae616464483978379c2e7673a [2022-07-12 10:35:19,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:35:19,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:35:19,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:35:19,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:35:19,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:35:19,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@121df57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19, skipping insertion in model container [2022-07-12 10:35:19,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:35:19,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:35:19,478 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-12 10:35:19,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:35:19,487 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:35:19,502 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-12 10:35:19,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:35:19,524 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:35:19,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19 WrapperNode [2022-07-12 10:35:19,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:35:19,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:35:19,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:35:19,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:35:19,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,556 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-07-12 10:35:19,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:35:19,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:35:19,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:35:19,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:35:19,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:35:19,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:35:19,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:35:19,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:35:19,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19" (1/1) ... [2022-07-12 10:35:19,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:35:19,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:19,601 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:35:19,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:35:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:35:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:35:19,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:35:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:35:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:35:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-12 10:35:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-12 10:35:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:35:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:35:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:35:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:35:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:35:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:35:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:35:19,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:35:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:35:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:35:19,628 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:35:19,709 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:35:19,711 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:35:19,956 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:35:20,014 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:35:20,015 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 10:35:20,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:35:20 BoogieIcfgContainer [2022-07-12 10:35:20,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:35:20,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:35:20,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:35:20,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:35:20,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:35:19" (1/3) ... [2022-07-12 10:35:20,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fb184e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:35:20, skipping insertion in model container [2022-07-12 10:35:20,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:35:19" (2/3) ... [2022-07-12 10:35:20,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fb184e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:35:20, skipping insertion in model container [2022-07-12 10:35:20,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:35:20" (3/3) ... [2022-07-12 10:35:20,038 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-07-12 10:35:20,042 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:35:20,048 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:35:20,048 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:35:20,048 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:35:20,103 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-12 10:35:20,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-07-12 10:35:20,177 INFO L129 PetriNetUnfolder]: 12/150 cut-off events. [2022-07-12 10:35:20,177 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:35:20,181 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-12 10:35:20,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 153 transitions, 330 flow [2022-07-12 10:35:20,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 139 transitions, 296 flow [2022-07-12 10:35:20,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:35:20,197 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@7ff742c9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@689ff3e9 [2022-07-12 10:35:20,197 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-12 10:35:20,216 INFO L129 PetriNetUnfolder]: 12/138 cut-off events. [2022-07-12 10:35:20,216 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:35:20,217 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:20,217 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-12 10:35:20,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:20,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:20,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1264132100, now seen corresponding path program 1 times [2022-07-12 10:35:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:20,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873014233] [2022-07-12 10:35:20,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:20,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:35:20,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:20,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873014233] [2022-07-12 10:35:20,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873014233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:35:20,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:35:20,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:35:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831712098] [2022-07-12 10:35:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:35:20,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:35:20,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:20,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:35:20,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:35:20,442 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 153 [2022-07-12 10:35:20,444 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-12 10:35:20,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:20,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 153 [2022-07-12 10:35:20,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:20,521 INFO L129 PetriNetUnfolder]: 41/264 cut-off events. [2022-07-12 10:35:20,526 INFO L130 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-07-12 10:35:20,528 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-12 10:35:20,532 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 9 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2022-07-12 10:35:20,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 298 flow [2022-07-12 10:35:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:35:20,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:35:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-07-12 10:35:20,546 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2022-07-12 10:35:20,546 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2022-07-12 10:35:20,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2022-07-12 10:35:20,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:20,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2022-07-12 10:35:20,556 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-12 10:35:20,562 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-12 10:35:20,562 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-12 10:35:20,563 INFO L186 Difference]: Start difference. First operand has 137 places, 139 transitions, 296 flow. Second operand 2 states and 287 transitions. [2022-07-12 10:35:20,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 298 flow [2022-07-12 10:35:20,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 286 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-12 10:35:20,572 INFO L242 Difference]: Finished difference. Result has 132 places, 127 transitions, 260 flow [2022-07-12 10:35:20,574 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-12 10:35:20,579 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2022-07-12 10:35:20,579 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 260 flow [2022-07-12 10:35:20,579 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-12 10:35:20,579 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:20,580 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-12 10:35:20,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:35:20,580 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:20,581 INFO L85 PathProgramCache]: Analyzing trace with hash 563593522, now seen corresponding path program 1 times [2022-07-12 10:35:20,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:20,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286648981] [2022-07-12 10:35:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:20,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:35:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:20,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286648981] [2022-07-12 10:35:20,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286648981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:35:20,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:35:20,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:35:20,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437383616] [2022-07-12 10:35:20,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:35:20,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:35:20,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:20,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:35:20,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:35:20,940 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 153 [2022-07-12 10:35:20,944 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-12 10:35:20,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:20,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 153 [2022-07-12 10:35:20,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:21,126 INFO L129 PetriNetUnfolder]: 295/678 cut-off events. [2022-07-12 10:35:21,126 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-12 10:35:21,129 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-12 10:35:21,133 INFO L132 encePairwiseOnDemand]: 143/153 looper letters, 44 selfloop transitions, 6 changer transitions 4/135 dead transitions. [2022-07-12 10:35:21,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 135 transitions, 384 flow [2022-07-12 10:35:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:35:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:35:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 807 transitions. [2022-07-12 10:35:21,137 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6593137254901961 [2022-07-12 10:35:21,137 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 807 transitions. [2022-07-12 10:35:21,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 807 transitions. [2022-07-12 10:35:21,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:21,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 807 transitions. [2022-07-12 10:35:21,139 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-12 10:35:21,142 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-12 10:35:21,143 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-12 10:35:21,143 INFO L186 Difference]: Start difference. First operand has 132 places, 127 transitions, 260 flow. Second operand 8 states and 807 transitions. [2022-07-12 10:35:21,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 135 transitions, 384 flow [2022-07-12 10:35:21,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:35:21,148 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 288 flow [2022-07-12 10:35:21,148 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-12 10:35:21,149 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-07-12 10:35:21,149 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 288 flow [2022-07-12 10:35:21,149 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-12 10:35:21,149 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:21,150 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-12 10:35:21,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:35:21,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:21,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1756520908, now seen corresponding path program 1 times [2022-07-12 10:35:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:21,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499255115] [2022-07-12 10:35:21,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:21,302 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-12 10:35:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:21,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499255115] [2022-07-12 10:35:21,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499255115] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:21,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033244119] [2022-07-12 10:35:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:21,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:21,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:21,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:35:21,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:35:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:21,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 10:35:21,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:21,514 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-12 10:35:21,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:35:21,651 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-12 10:35:21,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033244119] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:21,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:35:21,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-12 10:35:21,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115351679] [2022-07-12 10:35:21,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:35:21,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:35:21,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:21,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:35:21,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:35:21,655 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-07-12 10:35:21,656 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-12 10:35:21,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:21,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-07-12 10:35:21,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:21,770 INFO L129 PetriNetUnfolder]: 175/510 cut-off events. [2022-07-12 10:35:21,770 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-12 10:35:21,772 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-12 10:35:21,774 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 33 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2022-07-12 10:35:21,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 386 flow [2022-07-12 10:35:21,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:35:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:35:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-07-12 10:35:21,776 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7759103641456583 [2022-07-12 10:35:21,777 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-07-12 10:35:21,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-07-12 10:35:21,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:21,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-07-12 10:35:21,779 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-12 10:35:21,781 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-12 10:35:21,781 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-12 10:35:21,781 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 288 flow. Second operand 7 states and 831 transitions. [2022-07-12 10:35:21,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 386 flow [2022-07-12 10:35:21,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 368 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-07-12 10:35:21,785 INFO L242 Difference]: Finished difference. Result has 139 places, 130 transitions, 303 flow [2022-07-12 10:35:21,785 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-12 10:35:21,786 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-07-12 10:35:21,786 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 130 transitions, 303 flow [2022-07-12 10:35:21,787 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-12 10:35:21,787 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:21,787 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-12 10:35:21,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 10:35:22,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:22,004 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1066338293, now seen corresponding path program 1 times [2022-07-12 10:35:22,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:22,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801651444] [2022-07-12 10:35:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:22,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:22,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801651444] [2022-07-12 10:35:22,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801651444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:22,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784632322] [2022-07-12 10:35:22,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:22,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:22,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:22,152 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:35:22,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:35:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:22,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:35:22,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:22,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:35:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:22,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784632322] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:22,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:35:22,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-07-12 10:35:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952812243] [2022-07-12 10:35:22,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:35:22,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:35:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:35:22,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:35:22,503 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-07-12 10:35:22,504 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-12 10:35:22,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:22,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-07-12 10:35:22,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:22,759 INFO L129 PetriNetUnfolder]: 599/1273 cut-off events. [2022-07-12 10:35:22,759 INFO L130 PetriNetUnfolder]: For 404/585 co-relation queries the response was YES. [2022-07-12 10:35:22,762 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-12 10:35:22,767 INFO L132 encePairwiseOnDemand]: 141/153 looper letters, 74 selfloop transitions, 19 changer transitions 0/182 dead transitions. [2022-07-12 10:35:22,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 182 transitions, 642 flow [2022-07-12 10:35:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:35:22,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:35:22,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions. [2022-07-12 10:35:22,770 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.744503862150921 [2022-07-12 10:35:22,770 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions. [2022-07-12 10:35:22,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions. [2022-07-12 10:35:22,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:22,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions. [2022-07-12 10:35:22,773 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-12 10:35:22,775 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-12 10:35:22,776 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-12 10:35:22,776 INFO L186 Difference]: Start difference. First operand has 139 places, 130 transitions, 303 flow. Second operand 11 states and 1253 transitions. [2022-07-12 10:35:22,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 182 transitions, 642 flow [2022-07-12 10:35:22,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 182 transitions, 629 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:35:22,779 INFO L242 Difference]: Finished difference. Result has 151 places, 142 transitions, 402 flow [2022-07-12 10:35:22,780 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-12 10:35:22,780 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 14 predicate places. [2022-07-12 10:35:22,780 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 142 transitions, 402 flow [2022-07-12 10:35:22,781 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-12 10:35:22,781 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:22,781 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-12 10:35:22,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 10:35:22,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-12 10:35:22,999 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339177, now seen corresponding path program 2 times [2022-07-12 10:35:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:23,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571986] [2022-07-12 10:35:23,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:23,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:35:23,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:23,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571986] [2022-07-12 10:35:23,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:23,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522880149] [2022-07-12 10:35:23,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:35:23,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:23,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:23,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:35:23,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:35:23,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 10:35:23,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:35:23,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 10:35:23,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:23,329 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-12 10:35:23,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:35:23,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522880149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:35:23,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:35:23,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-12 10:35:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105001957] [2022-07-12 10:35:23,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:35:23,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:35:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:23,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:35:23,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:35:23,332 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2022-07-12 10:35:23,333 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-12 10:35:23,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:23,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2022-07-12 10:35:23,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:23,555 INFO L129 PetriNetUnfolder]: 413/833 cut-off events. [2022-07-12 10:35:23,556 INFO L130 PetriNetUnfolder]: For 772/877 co-relation queries the response was YES. [2022-07-12 10:35:23,558 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-12 10:35:23,561 INFO L132 encePairwiseOnDemand]: 144/153 looper letters, 42 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2022-07-12 10:35:23,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 144 transitions, 501 flow [2022-07-12 10:35:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:35:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:35:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 857 transitions. [2022-07-12 10:35:23,564 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7001633986928104 [2022-07-12 10:35:23,564 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 857 transitions. [2022-07-12 10:35:23,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 857 transitions. [2022-07-12 10:35:23,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:23,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 857 transitions. [2022-07-12 10:35:23,566 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-12 10:35:23,567 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-12 10:35:23,568 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-12 10:35:23,568 INFO L186 Difference]: Start difference. First operand has 151 places, 142 transitions, 402 flow. Second operand 8 states and 857 transitions. [2022-07-12 10:35:23,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 144 transitions, 501 flow [2022-07-12 10:35:23,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 144 transitions, 488 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-07-12 10:35:23,574 INFO L242 Difference]: Finished difference. Result has 150 places, 136 transitions, 379 flow [2022-07-12 10:35:23,574 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-12 10:35:23,577 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 13 predicate places. [2022-07-12 10:35:23,577 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 136 transitions, 379 flow [2022-07-12 10:35:23,577 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-12 10:35:23,577 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:23,577 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-12 10:35:23,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 10:35:23,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:23,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:35:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash 166796212, now seen corresponding path program 1 times [2022-07-12 10:35:23,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:23,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242009369] [2022-07-12 10:35:23,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:24,394 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-12 10:35:24,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:24,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242009369] [2022-07-12 10:35:24,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242009369] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:24,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392412452] [2022-07-12 10:35:24,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:24,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:24,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:24,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:35:24,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:35:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:24,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 10:35:24,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:25,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:35:25,489 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:25,490 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-12 10:35:25,571 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-12 10:35:25,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:35:25,767 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:25,768 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-12 10:35:26,304 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-12 10:35:26,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392412452] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:35:26,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:35:26,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 18] total 57 [2022-07-12 10:35:26,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464436373] [2022-07-12 10:35:26,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:35:26,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-12 10:35:26,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:26,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-12 10:35:26,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=2720, Unknown=0, NotChecked=0, Total=3192 [2022-07-12 10:35:26,309 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 153 [2022-07-12 10:35:26,312 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-12 10:35:26,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:26,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 153 [2022-07-12 10:35:26,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:29,199 INFO L129 PetriNetUnfolder]: 4198/6888 cut-off events. [2022-07-12 10:35:29,199 INFO L130 PetriNetUnfolder]: For 5982/5997 co-relation queries the response was YES. [2022-07-12 10:35:29,213 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-12 10:35:29,243 INFO L132 encePairwiseOnDemand]: 113/153 looper letters, 266 selfloop transitions, 104 changer transitions 10/436 dead transitions. [2022-07-12 10:35:29,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 436 transitions, 2224 flow [2022-07-12 10:35:29,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-12 10:35:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-07-12 10:35:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3548 transitions. [2022-07-12 10:35:29,251 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.49339452092893893 [2022-07-12 10:35:29,252 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3548 transitions. [2022-07-12 10:35:29,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3548 transitions. [2022-07-12 10:35:29,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:29,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3548 transitions. [2022-07-12 10:35:29,259 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-12 10:35:29,268 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-12 10:35:29,269 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-12 10:35:29,269 INFO L186 Difference]: Start difference. First operand has 150 places, 136 transitions, 379 flow. Second operand 47 states and 3548 transitions. [2022-07-12 10:35:29,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 436 transitions, 2224 flow [2022-07-12 10:35:29,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 436 transitions, 2174 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-12 10:35:29,304 INFO L242 Difference]: Finished difference. Result has 220 places, 229 transitions, 1139 flow [2022-07-12 10:35:29,304 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-12 10:35:29,306 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 83 predicate places. [2022-07-12 10:35:29,306 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 229 transitions, 1139 flow [2022-07-12 10:35:29,307 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-12 10:35:29,307 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:29,308 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-12 10:35:29,327 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-12 10:35:29,523 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-12 10:35:29,523 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-12 10:35:29,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:29,524 INFO L85 PathProgramCache]: Analyzing trace with hash 934935682, now seen corresponding path program 2 times [2022-07-12 10:35:29,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:29,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62933760] [2022-07-12 10:35:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:29,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:30,150 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-12 10:35:30,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:30,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62933760] [2022-07-12 10:35:30,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62933760] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805399747] [2022-07-12 10:35:30,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:35:30,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:30,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:30,152 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-12 10:35:30,153 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-12 10:35:30,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:35:30,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:35:30,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 10:35:30,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:30,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:30,660 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-12 10:35:31,040 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-12 10:35:31,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:35:31,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:31,208 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-12 10:35:31,585 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-12 10:35:31,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805399747] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:35:31,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:35:31,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 16] total 44 [2022-07-12 10:35:31,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129116030] [2022-07-12 10:35:31,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:35:31,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 10:35:31,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:31,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 10:35:31,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 10:35:31,590 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2022-07-12 10:35:31,592 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-12 10:35:31,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:31,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2022-07-12 10:35:31,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:35:37,222 INFO L129 PetriNetUnfolder]: 8669/14527 cut-off events. [2022-07-12 10:35:37,222 INFO L130 PetriNetUnfolder]: For 29571/29633 co-relation queries the response was YES. [2022-07-12 10:35:37,320 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-12 10:35:37,391 INFO L132 encePairwiseOnDemand]: 118/153 looper letters, 500 selfloop transitions, 222 changer transitions 21/795 dead transitions. [2022-07-12 10:35:37,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 795 transitions, 5369 flow [2022-07-12 10:35:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-12 10:35:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-07-12 10:35:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 4957 transitions. [2022-07-12 10:35:37,401 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.48356257926055995 [2022-07-12 10:35:37,401 INFO L72 ComplementDD]: Start complementDD. Operand 67 states and 4957 transitions. [2022-07-12 10:35:37,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 4957 transitions. [2022-07-12 10:35:37,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:35:37,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 4957 transitions. [2022-07-12 10:35:37,412 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-12 10:35:37,423 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-12 10:35:37,425 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-12 10:35:37,425 INFO L186 Difference]: Start difference. First operand has 220 places, 229 transitions, 1139 flow. Second operand 67 states and 4957 transitions. [2022-07-12 10:35:37,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 795 transitions, 5369 flow [2022-07-12 10:35:37,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 795 transitions, 5303 flow, removed 22 selfloop flow, removed 14 redundant places. [2022-07-12 10:35:37,603 INFO L242 Difference]: Finished difference. Result has 305 places, 407 transitions, 3103 flow [2022-07-12 10:35:37,603 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-12 10:35:37,604 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 168 predicate places. [2022-07-12 10:35:37,604 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 407 transitions, 3103 flow [2022-07-12 10:35:37,614 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-12 10:35:37,614 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:35:37,615 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-12 10:35:37,631 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-12 10:35:37,831 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-12 10:35:37,831 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-12 10:35:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:35:37,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1096212486, now seen corresponding path program 3 times [2022-07-12 10:35:37,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:35:37,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005381911] [2022-07-12 10:35:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:35:37,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:35:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:35:38,480 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-12 10:35:38,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:35:38,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005381911] [2022-07-12 10:35:38,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005381911] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:35:38,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326060746] [2022-07-12 10:35:38,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:35:38,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:35:38,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:35:38,482 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-12 10:35:38,483 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-12 10:35:38,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 10:35:38,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:35:38,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 10:35:38,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:35:38,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:35:38,640 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 10:35:38,640 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-12 10:35:38,812 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 10:35:38,812 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-12 10:35:38,937 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-12 10:35:39,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:35:39,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:35:39,828 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-12 10:35:39,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:35:39,998 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:39,998 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-12 10:35:40,154 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-12 10:35:40,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:35:40,327 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-12 10:35:41,511 WARN L833 $PredicateComparison]: unable to prove that (or (< 1 c_~N~0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (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)) (= 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) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse1 (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 (< .cse1 c_~min2~0)) (= c_~min1~0 .cse1)))))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (not (< (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_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 (* 4 c_~M~0))))) (or (not (< .cse2 c_~min2~0)) (= .cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse4 (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))) (or (< (select (select (store .cse4 |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) (< (select (select .cse4 c_~A~0.base) c_~A~0.offset) c_~min1~0))))))) is different from false [2022-07-12 10:35:41,549 WARN L833 $PredicateComparison]: unable to prove that (or (< 1 c_~N~0) (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)) (= 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) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse1 (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 (< .cse1 c_~min2~0)) (= c_~min1~0 .cse1)))))) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (not (< (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_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 (* 4 c_~M~0))))) (or (not (< .cse2 c_~min2~0)) (= .cse2 (select (select .cse3 c_~A~0.base) c_~A~0.offset)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse4 (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))) (or (< (select (select (store .cse4 |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) (< (select (select .cse4 c_~A~0.base) c_~A~0.offset) c_~min1~0)))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-07-12 10:35:41,631 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int)) (or (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (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))))) (< (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))) (< ~M~0 0) (<= 1 ~M~0))) (forall ((~M~0 Int)) (or (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)) (= 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))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int)) (~M~0 Int) (v_ArrVal_225 (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))) (or (< ~M~0 0) (< (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< (select (select (store .cse2 |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) (<= 1 ~M~0))))) (forall ((~M~0 Int)) (or (< ~M~0 0) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (not (< (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_227 (Array Int Int))) (let ((.cse4 (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 ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_227) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse3 c_~min2~0)) (= (select (select .cse4 c_~A~0.base) c_~A~0.offset) .cse3))))))) (<= 1 ~M~0)))) is different from false [2022-07-12 10:35:41,798 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int)) (or (< ~M~0 0) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (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_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= c_~min1~0 .cse0) (not (< .cse0 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))) (forall ((~M~0 Int)) (or (< ~M~0 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_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 .cse1) (not (< .cse1 c_~min1~0))))) (<= 1 ~M~0))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int)) (~M~0 Int) (v_ArrVal_225 (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))) (or (< (select (select (store .cse2 |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) (< ~M~0 0) (< (select (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (<= 1 ~M~0))))) (forall ((~M~0 Int)) (or (< ~M~0 0) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse4 (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 ((.cse3 (select (select (store .cse4 |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 (< .cse3 c_~min2~0)) (= .cse3 (select (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) (not (< (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-12 10:35:41,889 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int)) (or (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (not (< (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_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_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (not (< .cse0 c_~min2~0)))))))) (< ~M~0 0) (<= 1 ~M~0))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse2 (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 .cse2) (not (< .cse2 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))) (< ~M~0 0) (<= 1 ~M~0))) (forall ((~M~0 Int)) (or (< ~M~0 0) (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (let ((.cse3 (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 (= c_~min2~0 .cse3) (not (< .cse3 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))))) (<= 1 ~M~0))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int)) (~M~0 Int) (v_ArrVal_225 (Array Int Int))) (let ((.cse4 (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))) (or (< ~M~0 0) (< (select (select (store .cse4 |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 .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (<= 1 ~M~0)))))) is different from false [2022-07-12 10:35:41,946 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int)) (or (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_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= c_~min2~0 .cse0) (not (< .cse0 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))))) (< ~M~0 0) (<= 1 ~M~0))) (forall ((~M~0 Int)) (or (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) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse1 (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 (< .cse1 c_~min2~0)) (= c_~min1~0 .cse1)))))) (< ~M~0 0) (<= 1 ~M~0))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_227 (Array Int Int)) (v_ArrVal_226 (Array Int Int)) (~M~0 Int) (v_ArrVal_225 (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))) (or (< (select (select .cse2 |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) (< ~M~0 0) (< (select (select (store .cse2 |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) (<= 1 ~M~0))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_226 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (not (< (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)) (forall ((v_ArrVal_227 (Array Int Int))) (let ((.cse4 (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 ((.cse3 (select (select (store .cse4 |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 (< .cse3 c_~min2~0)) (= .cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< ~M~0 0) (<= 1 ~M~0)))) is different from false [2022-07-12 10:35:42,191 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:42,192 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 114 treesize of output 78 [2022-07-12 10:35:42,207 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:42,208 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 3210 treesize of output 2934 [2022-07-12 10:35:42,255 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 2784 treesize of output 2352 [2022-07-12 10:35:42,273 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:42,274 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 2466 treesize of output 2118 [2022-07-12 10:35:42,334 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:42,334 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 1986 treesize of output 1814 [2022-07-12 10:35:45,388 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:45,389 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 84 treesize of output 60 [2022-07-12 10:35:45,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:35:45,397 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:45,397 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 381 treesize of output 353 [2022-07-12 10:35:45,407 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:45,407 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 349 treesize of output 313 [2022-07-12 10:35:45,417 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:45,418 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 217 treesize of output 201 [2022-07-12 10:35:45,815 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:35:45,816 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 58 treesize of output 46 [2022-07-12 10:35:45,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:35:45,823 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:45,824 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 259 treesize of output 239 [2022-07-12 10:35:45,831 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:45,832 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 235 treesize of output 223 [2022-07-12 10:35:45,839 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-12 10:35:45,840 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 219 treesize of output 191 [2022-07-12 10:35:45,919 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 10:35:45,919 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 91 treesize of output 1 [2022-07-12 10:35:46,260 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-12 10:35:46,269 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-12 10:35:46,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326060746] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:35:46,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:35:46,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 26] total 71 [2022-07-12 10:35:46,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626402729] [2022-07-12 10:35:46,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:35:46,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-07-12 10:35:46,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:35:46,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-07-12 10:35:46,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=3575, Unknown=12, NotChecked=910, Total=4970 [2022-07-12 10:35:46,277 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 153 [2022-07-12 10:35:46,279 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-12 10:35:46,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:35:46,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 153 [2022-07-12 10:35:46,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:36:03,408 INFO L129 PetriNetUnfolder]: 13106/21481 cut-off events. [2022-07-12 10:36:03,408 INFO L130 PetriNetUnfolder]: For 108335/108596 co-relation queries the response was YES. [2022-07-12 10:36:03,540 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-12 10:36:03,644 INFO L132 encePairwiseOnDemand]: 107/153 looper letters, 515 selfloop transitions, 348 changer transitions 10/925 dead transitions. [2022-07-12 10:36:03,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 925 transitions, 8679 flow [2022-07-12 10:36:03,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-12 10:36:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-07-12 10:36:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 3950 transitions. [2022-07-12 10:36:03,718 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.403390522875817 [2022-07-12 10:36:03,718 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 3950 transitions. [2022-07-12 10:36:03,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 3950 transitions. [2022-07-12 10:36:03,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:36:03,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 3950 transitions. [2022-07-12 10:36:03,729 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-12 10:36:03,737 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-12 10:36:03,738 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-12 10:36:03,738 INFO L186 Difference]: Start difference. First operand has 305 places, 407 transitions, 3103 flow. Second operand 64 states and 3950 transitions. [2022-07-12 10:36:03,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 925 transitions, 8679 flow [2022-07-12 10:36:04,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 925 transitions, 8457 flow, removed 78 selfloop flow, removed 22 redundant places. [2022-07-12 10:36:04,593 INFO L242 Difference]: Finished difference. Result has 371 places, 636 transitions, 6498 flow [2022-07-12 10:36:04,593 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-12 10:36:04,593 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 234 predicate places. [2022-07-12 10:36:04,593 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 636 transitions, 6498 flow [2022-07-12 10:36:04,594 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-12 10:36:04,594 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:36:04,595 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-12 10:36:04,611 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-12 10:36:04,802 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-12 10:36:04,802 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-12 10:36:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:36:04,803 INFO L85 PathProgramCache]: Analyzing trace with hash -5287510, now seen corresponding path program 4 times [2022-07-12 10:36:04,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:36:04,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362311138] [2022-07-12 10:36:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:36:04,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:36:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:36:05,459 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-12 10:36:05,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:36:05,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362311138] [2022-07-12 10:36:05,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362311138] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:36:05,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425111368] [2022-07-12 10:36:05,459 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 10:36:05,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:36:05,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:36:05,461 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-12 10:36:05,462 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-12 10:36:05,538 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 10:36:05,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:36:05,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 10:36:05,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:36:05,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 10:36:05,595 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 10:36:05,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 10:36:05,890 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:36:05,890 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-12 10:36:06,788 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-12 10:36:06,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:36:06,933 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-12 10:36:07,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:07,244 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-12 10:36:07,588 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-12 10:36:07,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:36:07,902 WARN L833 $PredicateComparison]: unable to prove that (and (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (< (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))) c_~min2~0)))) (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int))) (let ((.cse0 (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))))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0))))) is different from false [2022-07-12 10:36:07,987 WARN L833 $PredicateComparison]: unable to prove that (and (or (= c_~min2~0 c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0)))) (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_263) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< .cse0 c_~min2~0)) (< 0 ~M~0) (= c_~min1~0 .cse0))))) is different from false [2022-07-12 10:36:08,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:08,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 509 treesize of output 485 [2022-07-12 10:36:08,198 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-12 10:36:08,202 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-12 10:36:08,244 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-12 10:36:08,260 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-12 10:36:10,226 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-12 10:36:10,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425111368] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:36:10,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:36:10,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 30] total 75 [2022-07-12 10:36:10,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726840593] [2022-07-12 10:36:10,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:36:10,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-12 10:36:10,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:36:10,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-12 10:36:10,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=4753, Unknown=2, NotChecked=286, Total=5550 [2022-07-12 10:36:10,235 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 153 [2022-07-12 10:36:10,238 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-12 10:36:10,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:36:10,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 153 [2022-07-12 10:36:10,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:36:23,539 INFO L129 PetriNetUnfolder]: 23357/39024 cut-off events. [2022-07-12 10:36:23,540 INFO L130 PetriNetUnfolder]: For 397545/397845 co-relation queries the response was YES. [2022-07-12 10:36:23,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211845 conditions, 39024 events. 23357/39024 cut-off events. For 397545/397845 co-relation queries the response was YES. Maximal size of possible extension queue 2072. Compared 339512 event pairs, 1359 based on Foata normal form. 62/38785 useless extension candidates. Maximal degree in co-relation 211747. Up to 7994 conditions per place. [2022-07-12 10:36:24,143 INFO L132 encePairwiseOnDemand]: 118/153 looper letters, 789 selfloop transitions, 896 changer transitions 20/1750 dead transitions. [2022-07-12 10:36:24,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 1750 transitions, 22249 flow [2022-07-12 10:36:24,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-07-12 10:36:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-07-12 10:36:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 4724 transitions. [2022-07-12 10:36:24,148 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4062607499140007 [2022-07-12 10:36:24,148 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 4724 transitions. [2022-07-12 10:36:24,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 4724 transitions. [2022-07-12 10:36:24,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:36:24,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 4724 transitions. [2022-07-12 10:36:24,154 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-12 10:36:24,162 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-12 10:36:24,163 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-12 10:36:24,163 INFO L186 Difference]: Start difference. First operand has 371 places, 636 transitions, 6498 flow. Second operand 76 states and 4724 transitions. [2022-07-12 10:36:24,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 1750 transitions, 22249 flow [2022-07-12 10:36:29,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 1750 transitions, 21344 flow, removed 416 selfloop flow, removed 35 redundant places. [2022-07-12 10:36:29,390 INFO L242 Difference]: Finished difference. Result has 444 places, 1210 transitions, 17244 flow [2022-07-12 10:36:29,391 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-12 10:36:29,392 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 307 predicate places. [2022-07-12 10:36:29,392 INFO L495 AbstractCegarLoop]: Abstraction has has 444 places, 1210 transitions, 17244 flow [2022-07-12 10:36:29,393 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-12 10:36:29,393 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:36:29,393 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-12 10:36:29,411 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-12 10:36:29,608 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-12 10:36:29,609 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-12 10:36:29,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:36:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1877669674, now seen corresponding path program 5 times [2022-07-12 10:36:29,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:36:29,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440499476] [2022-07-12 10:36:29,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:36:29,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:36:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:36:30,229 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-12 10:36:30,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:36:30,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440499476] [2022-07-12 10:36:30,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440499476] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:36:30,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205956960] [2022-07-12 10:36:30,230 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 10:36:30,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:36:30,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:36:30,231 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-12 10:36:30,232 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-12 10:36:30,305 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:36:30,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:36:30,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 10:36:30,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:36:30,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:30,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 79 treesize of output 81 [2022-07-12 10:36:31,341 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-12 10:36:31,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:36:31,511 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:36:31,511 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-12 10:36:31,829 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-12 10:36:31,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205956960] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:36:31,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:36:31,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 15] total 50 [2022-07-12 10:36:31,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207941694] [2022-07-12 10:36:31,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:36:31,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-12 10:36:31,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:36:31,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-12 10:36:31,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2127, Unknown=0, NotChecked=0, Total=2450 [2022-07-12 10:36:31,832 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2022-07-12 10:36:31,834 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-12 10:36:31,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:36:31,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2022-07-12 10:36:31,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:36:53,736 INFO L129 PetriNetUnfolder]: 33500/55434 cut-off events. [2022-07-12 10:36:53,736 INFO L130 PetriNetUnfolder]: For 990628/990807 co-relation queries the response was YES. [2022-07-12 10:36:55,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 363867 conditions, 55434 events. 33500/55434 cut-off events. For 990628/990807 co-relation queries the response was YES. Maximal size of possible extension queue 3017. Compared 504665 event pairs, 4559 based on Foata normal form. 25/55133 useless extension candidates. Maximal degree in co-relation 363743. Up to 29456 conditions per place. [2022-07-12 10:36:55,509 INFO L132 encePairwiseOnDemand]: 115/153 looper letters, 1097 selfloop transitions, 1793 changer transitions 7/2949 dead transitions. [2022-07-12 10:36:55,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 2949 transitions, 47556 flow [2022-07-12 10:36:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-07-12 10:36:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2022-07-12 10:36:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 7553 transitions. [2022-07-12 10:36:55,516 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.47467320261437906 [2022-07-12 10:36:55,517 INFO L72 ComplementDD]: Start complementDD. Operand 104 states and 7553 transitions. [2022-07-12 10:36:55,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 7553 transitions. [2022-07-12 10:36:55,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:36:55,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 104 states and 7553 transitions. [2022-07-12 10:36:55,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 105 states, 104 states have (on average 72.625) internal successors, (7553), 104 states have internal predecessors, (7553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:36:55,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 105 states, 105 states have (on average 153.0) internal successors, (16065), 105 states have internal predecessors, (16065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:36:55,538 INFO L81 ComplementDD]: Finished complementDD. Result has 105 states, 105 states have (on average 153.0) internal successors, (16065), 105 states have internal predecessors, (16065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:36:55,538 INFO L186 Difference]: Start difference. First operand has 444 places, 1210 transitions, 17244 flow. Second operand 104 states and 7553 transitions. [2022-07-12 10:36:55,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 2949 transitions, 47556 flow [2022-07-12 10:37:23,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 2949 transitions, 45141 flow, removed 1123 selfloop flow, removed 31 redundant places. [2022-07-12 10:37:24,021 INFO L242 Difference]: Finished difference. Result has 547 places, 2523 transitions, 41358 flow [2022-07-12 10:37:24,022 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=583, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=104, PETRI_FLOW=41358, PETRI_PLACES=547, PETRI_TRANSITIONS=2523} [2022-07-12 10:37:24,023 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 410 predicate places. [2022-07-12 10:37:24,023 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 2523 transitions, 41358 flow [2022-07-12 10:37:24,023 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-12 10:37:24,024 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:37:24,024 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-12 10:37:24,040 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-12 10:37:24,228 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-12 10:37:24,228 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-12 10:37:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:37:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1470080442, now seen corresponding path program 6 times [2022-07-12 10:37:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:37:24,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153348346] [2022-07-12 10:37:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:37:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:37:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:37:24,814 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-12 10:37:24,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:37:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153348346] [2022-07-12 10:37:24,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153348346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:37:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529685456] [2022-07-12 10:37:24,814 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 10:37:24,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:37:24,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:37:24,815 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-12 10:37:24,816 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-12 10:37:24,891 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-07-12 10:37:24,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:37:24,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 10:37:24,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:37:25,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:25,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 85 treesize of output 85 [2022-07-12 10:37:26,288 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-12 10:37:26,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:37:26,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:37:26,552 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-12 10:37:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:37:27,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529685456] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:37:27,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:37:27,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 21] total 62 [2022-07-12 10:37:27,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532041721] [2022-07-12 10:37:27,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:37:27,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-12 10:37:27,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:37:27,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-12 10:37:27,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=3257, Unknown=0, NotChecked=0, Total=3782 [2022-07-12 10:37:27,070 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 153 [2022-07-12 10:37:27,072 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 2523 transitions, 41358 flow. Second operand has 62 states, 62 states have (on average 67.04838709677419) internal successors, (4157), 62 states have internal predecessors, (4157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:37:27,072 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:37:27,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 153 [2022-07-12 10:37:27,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand