./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.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-bad-counter-queue2.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 7c615a04683f0f8050243ec529c03e20511a5c93f5e823175650f11e9fefc562 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:29:04,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:29:04,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:29:04,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:29:04,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:29:04,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:29:04,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:29:04,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:29:04,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:29:04,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:29:04,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:29:04,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:29:04,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:29:04,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:29:04,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:29:04,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:29:04,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:29:04,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:29:04,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:29:04,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:29:04,864 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:29:04,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:29:04,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:29:04,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:29:04,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:29:04,873 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:29:04,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:29:04,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:29:04,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:29:04,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:29:04,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:29:04,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:29:04,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:29:04,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:29:04,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:29:04,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:29:04,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:29:04,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:29:04,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:29:04,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:29:04,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:29:04,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:29:04,885 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:29:04,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:29:04,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:29:04,910 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:29:04,910 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:29:04,910 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:29:04,911 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:29:04,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:29:04,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:29:04,911 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:29:04,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:29:04,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:29:04,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:29:04,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:29:04,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:29:04,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:29:04,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:29:04,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:29:04,913 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:29:04,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:29:04,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:29:04,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:29:04,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:29:04,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:29:04,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:29:04,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:29:04,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:29:04,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:29:04,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:29:04,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:29:04,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:29:04,916 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:29:04,916 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:29:04,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:29:04,916 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 -> 7c615a04683f0f8050243ec529c03e20511a5c93f5e823175650f11e9fefc562 [2022-07-12 10:29:05,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:29:05,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:29:05,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:29:05,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:29:05,160 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:29:05,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2022-07-12 10:29:05,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d046c2786/90bbb2f80b9d4e31a6165c06486f893a/FLAGe9ec1f941 [2022-07-12 10:29:05,585 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:29:05,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2022-07-12 10:29:05,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d046c2786/90bbb2f80b9d4e31a6165c06486f893a/FLAGe9ec1f941 [2022-07-12 10:29:05,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d046c2786/90bbb2f80b9d4e31a6165c06486f893a [2022-07-12 10:29:05,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:29:05,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:29:05,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:29:05,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:29:05,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:29:05,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:29:05" (1/1) ... [2022-07-12 10:29:05,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f026810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:05, skipping insertion in model container [2022-07-12 10:29:05,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:29:05" (1/1) ... [2022-07-12 10:29:05,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:29:05,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:29:05,852 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-bad-counter-queue2.wvr.c[2271,2284] [2022-07-12 10:29:05,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:29:05,885 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:29:05,924 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-bad-counter-queue2.wvr.c[2271,2284] [2022-07-12 10:29:05,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:29:05,943 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:29:05,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:05 WrapperNode [2022-07-12 10:29:05,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:29:05,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:29:05,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:29:05,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:29:05,965 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:29:05" (1/1) ... [2022-07-12 10:29:05,977 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:29:05" (1/1) ... [2022-07-12 10:29:06,016 INFO L137 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 138 [2022-07-12 10:29:06,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:29:06,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:29:06,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:29:06,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:29:06,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:05" (1/1) ... [2022-07-12 10:29:06,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:05" (1/1) ... [2022-07-12 10:29:06,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:05" (1/1) ... [2022-07-12 10:29:06,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:05" (1/1) ... [2022-07-12 10:29:06,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:05" (1/1) ... [2022-07-12 10:29:06,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:05" (1/1) ... [2022-07-12 10:29:06,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:05" (1/1) ... [2022-07-12 10:29:06,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:29:06,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:29:06,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:29:06,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:29:06,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:05" (1/1) ... [2022-07-12 10:29:06,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:29:06,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:06,119 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:29:06,150 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:29:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:29:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:29:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:29:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:29:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:29:06,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:29:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:29:06,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:29:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:29:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:29:06,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:29:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 10:29:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:29:06,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:29:06,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:29:06,163 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:29:06,219 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:29:06,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:29:06,457 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:29:06,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:29:06,535 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 10:29:06,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:29:06 BoogieIcfgContainer [2022-07-12 10:29:06,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:29:06,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:29:06,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:29:06,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:29:06,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:29:05" (1/3) ... [2022-07-12 10:29:06,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352f0263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:29:06, skipping insertion in model container [2022-07-12 10:29:06,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:29:05" (2/3) ... [2022-07-12 10:29:06,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352f0263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:29:06, skipping insertion in model container [2022-07-12 10:29:06,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:29:06" (3/3) ... [2022-07-12 10:29:06,546 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue2.wvr.c [2022-07-12 10:29:06,549 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:29:06,555 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:29:06,555 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:29:06,555 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:29:06,601 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-12 10:29:06,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 117 transitions, 250 flow [2022-07-12 10:29:06,686 INFO L129 PetriNetUnfolder]: 9/115 cut-off events. [2022-07-12 10:29:06,687 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:29:06,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 115 events. 9/115 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-07-12 10:29:06,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 117 transitions, 250 flow [2022-07-12 10:29:06,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 106 transitions, 224 flow [2022-07-12 10:29:06,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:29:06,722 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@42825964, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52399c57 [2022-07-12 10:29:06,722 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-12 10:29:06,761 INFO L129 PetriNetUnfolder]: 9/105 cut-off events. [2022-07-12 10:29:06,761 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:29:06,761 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:06,762 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] [2022-07-12 10:29:06,762 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:06,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1997616241, now seen corresponding path program 1 times [2022-07-12 10:29:06,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:06,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911395973] [2022-07-12 10:29:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:06,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:07,012 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:29:07,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:07,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911395973] [2022-07-12 10:29:07,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911395973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:07,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:07,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:29:07,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452774837] [2022-07-12 10:29:07,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:07,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:29:07,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:07,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:29:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:29:07,059 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 117 [2022-07-12 10:29:07,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 106 transitions, 224 flow. Second operand has 2 states, 2 states have (on average 107.0) internal successors, (214), 2 states have internal predecessors, (214), 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:29:07,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:07,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 117 [2022-07-12 10:29:07,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:07,120 INFO L129 PetriNetUnfolder]: 12/133 cut-off events. [2022-07-12 10:29:07,120 INFO L130 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-07-12 10:29:07,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 133 events. 12/133 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 170 event pairs, 3 based on Foata normal form. 13/135 useless extension candidates. Maximal degree in co-relation 78. Up to 19 conditions per place. [2022-07-12 10:29:07,122 INFO L132 encePairwiseOnDemand]: 111/117 looper letters, 6 selfloop transitions, 0 changer transitions 3/100 dead transitions. [2022-07-12 10:29:07,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 100 transitions, 224 flow [2022-07-12 10:29:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:29:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:29:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 220 transitions. [2022-07-12 10:29:07,132 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9401709401709402 [2022-07-12 10:29:07,132 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 220 transitions. [2022-07-12 10:29:07,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 220 transitions. [2022-07-12 10:29:07,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:07,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 220 transitions. [2022-07-12 10:29:07,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 110.0) internal successors, (220), 2 states have internal predecessors, (220), 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:29:07,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:29:07,143 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:29:07,144 INFO L186 Difference]: Start difference. First operand has 104 places, 106 transitions, 224 flow. Second operand 2 states and 220 transitions. [2022-07-12 10:29:07,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 100 transitions, 224 flow [2022-07-12 10:29:07,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 100 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:29:07,150 INFO L242 Difference]: Finished difference. Result has 101 places, 97 transitions, 198 flow [2022-07-12 10:29:07,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=198, PETRI_PLACES=101, PETRI_TRANSITIONS=97} [2022-07-12 10:29:07,154 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -3 predicate places. [2022-07-12 10:29:07,154 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 198 flow [2022-07-12 10:29:07,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 107.0) internal successors, (214), 2 states have internal predecessors, (214), 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:29:07,155 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:07,155 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] [2022-07-12 10:29:07,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:29:07,155 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1204015377, now seen corresponding path program 1 times [2022-07-12 10:29:07,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:07,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802245012] [2022-07-12 10:29:07,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:07,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:07,347 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:29:07,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802245012] [2022-07-12 10:29:07,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802245012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:07,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:07,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 10:29:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104613959] [2022-07-12 10:29:07,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:07,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 10:29:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 10:29:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 10:29:07,350 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 117 [2022-07-12 10:29:07,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 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:29:07,351 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:07,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 117 [2022-07-12 10:29:07,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:07,405 INFO L129 PetriNetUnfolder]: 13/150 cut-off events. [2022-07-12 10:29:07,405 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-07-12 10:29:07,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 150 events. 13/150 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 252 event pairs, 0 based on Foata normal form. 1/141 useless extension candidates. Maximal degree in co-relation 192. Up to 24 conditions per place. [2022-07-12 10:29:07,406 INFO L132 encePairwiseOnDemand]: 111/117 looper letters, 20 selfloop transitions, 3 changer transitions 4/105 dead transitions. [2022-07-12 10:29:07,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 271 flow [2022-07-12 10:29:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 10:29:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-12 10:29:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-07-12 10:29:07,408 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8 [2022-07-12 10:29:07,409 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 468 transitions. [2022-07-12 10:29:07,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 468 transitions. [2022-07-12 10:29:07,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:07,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 468 transitions. [2022-07-12 10:29:07,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.6) internal successors, (468), 5 states have internal predecessors, (468), 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:29:07,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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:29:07,412 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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:29:07,412 INFO L186 Difference]: Start difference. First operand has 101 places, 97 transitions, 198 flow. Second operand 5 states and 468 transitions. [2022-07-12 10:29:07,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 105 transitions, 271 flow [2022-07-12 10:29:07,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 105 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:29:07,414 INFO L242 Difference]: Finished difference. Result has 105 places, 99 transitions, 221 flow [2022-07-12 10:29:07,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2022-07-12 10:29:07,414 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2022-07-12 10:29:07,414 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 221 flow [2022-07-12 10:29:07,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 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:29:07,415 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:07,415 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] [2022-07-12 10:29:07,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:29:07,415 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:07,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:07,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1430434687, now seen corresponding path program 1 times [2022-07-12 10:29:07,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:07,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993293512] [2022-07-12 10:29:07,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:07,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:07,483 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:29:07,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:07,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993293512] [2022-07-12 10:29:07,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993293512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:07,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:07,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:29:07,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369542746] [2022-07-12 10:29:07,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:07,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:29:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:07,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:29:07,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:29:07,486 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 117 [2022-07-12 10:29:07,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 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:29:07,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:07,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 117 [2022-07-12 10:29:07,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:07,585 INFO L129 PetriNetUnfolder]: 83/368 cut-off events. [2022-07-12 10:29:07,585 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-07-12 10:29:07,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 368 events. 83/368 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1527 event pairs, 34 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 615. Up to 125 conditions per place. [2022-07-12 10:29:07,587 INFO L132 encePairwiseOnDemand]: 108/117 looper letters, 41 selfloop transitions, 8 changer transitions 0/119 dead transitions. [2022-07-12 10:29:07,587 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 119 transitions, 374 flow [2022-07-12 10:29:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:29:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:29:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 710 transitions. [2022-07-12 10:29:07,589 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7585470085470085 [2022-07-12 10:29:07,589 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 710 transitions. [2022-07-12 10:29:07,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 710 transitions. [2022-07-12 10:29:07,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:07,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 710 transitions. [2022-07-12 10:29:07,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 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:29:07,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 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:29:07,593 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 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:29:07,593 INFO L186 Difference]: Start difference. First operand has 105 places, 99 transitions, 221 flow. Second operand 8 states and 710 transitions. [2022-07-12 10:29:07,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 119 transitions, 374 flow [2022-07-12 10:29:07,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 119 transitions, 365 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-12 10:29:07,595 INFO L242 Difference]: Finished difference. Result has 110 places, 102 transitions, 250 flow [2022-07-12 10:29:07,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=250, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2022-07-12 10:29:07,596 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 6 predicate places. [2022-07-12 10:29:07,596 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 250 flow [2022-07-12 10:29:07,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 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:29:07,597 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:07,597 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] [2022-07-12 10:29:07,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:29:07,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:07,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:07,598 INFO L85 PathProgramCache]: Analyzing trace with hash -852119249, now seen corresponding path program 1 times [2022-07-12 10:29:07,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:07,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265289258] [2022-07-12 10:29:07,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:07,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:07,704 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:29:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:07,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265289258] [2022-07-12 10:29:07,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265289258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:29:07,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:29:07,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:29:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994729668] [2022-07-12 10:29:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:07,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:29:07,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:07,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:29:07,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:29:07,716 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 117 [2022-07-12 10:29:07,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 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:29:07,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:07,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 117 [2022-07-12 10:29:07,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:07,824 INFO L129 PetriNetUnfolder]: 67/286 cut-off events. [2022-07-12 10:29:07,825 INFO L130 PetriNetUnfolder]: For 51/54 co-relation queries the response was YES. [2022-07-12 10:29:07,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 286 events. 67/286 cut-off events. For 51/54 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1018 event pairs, 36 based on Foata normal form. 3/268 useless extension candidates. Maximal degree in co-relation 502. Up to 124 conditions per place. [2022-07-12 10:29:07,828 INFO L132 encePairwiseOnDemand]: 108/117 looper letters, 27 selfloop transitions, 6 changer transitions 11/114 dead transitions. [2022-07-12 10:29:07,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 114 transitions, 365 flow [2022-07-12 10:29:07,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:29:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:29:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 706 transitions. [2022-07-12 10:29:07,830 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7542735042735043 [2022-07-12 10:29:07,830 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 706 transitions. [2022-07-12 10:29:07,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 706 transitions. [2022-07-12 10:29:07,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:07,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 706 transitions. [2022-07-12 10:29:07,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.25) internal successors, (706), 8 states have internal predecessors, (706), 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:29:07,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 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:29:07,835 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 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:29:07,835 INFO L186 Difference]: Start difference. First operand has 110 places, 102 transitions, 250 flow. Second operand 8 states and 706 transitions. [2022-07-12 10:29:07,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 114 transitions, 365 flow [2022-07-12 10:29:07,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 114 transitions, 355 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:29:07,838 INFO L242 Difference]: Finished difference. Result has 115 places, 100 transitions, 244 flow [2022-07-12 10:29:07,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=115, PETRI_TRANSITIONS=100} [2022-07-12 10:29:07,838 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 11 predicate places. [2022-07-12 10:29:07,839 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 100 transitions, 244 flow [2022-07-12 10:29:07,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.0) internal successors, (602), 7 states have internal predecessors, (602), 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:29:07,839 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:07,839 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] [2022-07-12 10:29:07,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:29:07,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:07,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1474470436, now seen corresponding path program 1 times [2022-07-12 10:29:07,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:07,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521429209] [2022-07-12 10:29:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:07,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:07,903 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:29:07,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:07,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521429209] [2022-07-12 10:29:07,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521429209] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:07,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187763499] [2022-07-12 10:29:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:07,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:07,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:07,915 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:29:07,916 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:29:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:07,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 10:29:07,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:08,077 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:29:08,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:08,218 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:29:08,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187763499] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:08,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:29:08,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-12 10:29:08,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328147497] [2022-07-12 10:29:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:08,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:29:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:08,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:29:08,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:29:08,223 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 117 [2022-07-12 10:29:08,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 100 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 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:29:08,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:08,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 117 [2022-07-12 10:29:08,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:08,303 INFO L129 PetriNetUnfolder]: 58/226 cut-off events. [2022-07-12 10:29:08,303 INFO L130 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-07-12 10:29:08,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 226 events. 58/226 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 641 event pairs, 13 based on Foata normal form. 8/229 useless extension candidates. Maximal degree in co-relation 432. Up to 65 conditions per place. [2022-07-12 10:29:08,304 INFO L132 encePairwiseOnDemand]: 109/117 looper letters, 30 selfloop transitions, 7 changer transitions 0/107 dead transitions. [2022-07-12 10:29:08,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 107 transitions, 341 flow [2022-07-12 10:29:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:29:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:29:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 615 transitions. [2022-07-12 10:29:08,306 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7509157509157509 [2022-07-12 10:29:08,306 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 615 transitions. [2022-07-12 10:29:08,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 615 transitions. [2022-07-12 10:29:08,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:08,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 615 transitions. [2022-07-12 10:29:08,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 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:29:08,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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:29:08,309 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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:29:08,309 INFO L186 Difference]: Start difference. First operand has 115 places, 100 transitions, 244 flow. Second operand 7 states and 615 transitions. [2022-07-12 10:29:08,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 107 transitions, 341 flow [2022-07-12 10:29:08,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 107 transitions, 315 flow, removed 7 selfloop flow, removed 9 redundant places. [2022-07-12 10:29:08,311 INFO L242 Difference]: Finished difference. Result has 111 places, 102 transitions, 255 flow [2022-07-12 10:29:08,311 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=111, PETRI_TRANSITIONS=102} [2022-07-12 10:29:08,312 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 7 predicate places. [2022-07-12 10:29:08,312 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 255 flow [2022-07-12 10:29:08,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 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:29:08,312 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:08,312 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] [2022-07-12 10:29:08,333 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:29:08,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:08,531 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:08,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1354192604, now seen corresponding path program 1 times [2022-07-12 10:29:08,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:08,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009958406] [2022-07-12 10:29:08,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:08,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:08,591 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:29:08,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:08,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009958406] [2022-07-12 10:29:08,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009958406] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:08,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930072485] [2022-07-12 10:29:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:08,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:08,608 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:29:08,610 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:29:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:08,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 10:29:08,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:08,748 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:29:08,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:08,861 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:29:08,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930072485] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:08,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 10:29:08,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-12 10:29:08,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242442974] [2022-07-12 10:29:08,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:29:08,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:29:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:08,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:29:08,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-12 10:29:08,863 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 117 [2022-07-12 10:29:08,863 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 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:29:08,863 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:08,863 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 117 [2022-07-12 10:29:08,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:08,935 INFO L129 PetriNetUnfolder]: 46/209 cut-off events. [2022-07-12 10:29:08,935 INFO L130 PetriNetUnfolder]: For 65/80 co-relation queries the response was YES. [2022-07-12 10:29:08,936 INFO L84 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 209 events. 46/209 cut-off events. For 65/80 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 523 event pairs, 9 based on Foata normal form. 15/211 useless extension candidates. Maximal degree in co-relation 397. Up to 54 conditions per place. [2022-07-12 10:29:08,936 INFO L132 encePairwiseOnDemand]: 109/117 looper letters, 32 selfloop transitions, 7 changer transitions 0/109 dead transitions. [2022-07-12 10:29:08,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 109 transitions, 360 flow [2022-07-12 10:29:08,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:29:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:29:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 615 transitions. [2022-07-12 10:29:08,938 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7509157509157509 [2022-07-12 10:29:08,938 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 615 transitions. [2022-07-12 10:29:08,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 615 transitions. [2022-07-12 10:29:08,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:08,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 615 transitions. [2022-07-12 10:29:08,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.85714285714286) internal successors, (615), 7 states have internal predecessors, (615), 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:29:08,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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:29:08,940 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 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:29:08,940 INFO L186 Difference]: Start difference. First operand has 111 places, 102 transitions, 255 flow. Second operand 7 states and 615 transitions. [2022-07-12 10:29:08,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 109 transitions, 360 flow [2022-07-12 10:29:08,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 109 transitions, 351 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:29:08,942 INFO L242 Difference]: Finished difference. Result has 115 places, 103 transitions, 274 flow [2022-07-12 10:29:08,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=115, PETRI_TRANSITIONS=103} [2022-07-12 10:29:08,943 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 11 predicate places. [2022-07-12 10:29:08,943 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 103 transitions, 274 flow [2022-07-12 10:29:08,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 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:29:08,944 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:08,944 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] [2022-07-12 10:29:08,967 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:29:09,167 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,SelfDestructingSolverStorable5 [2022-07-12 10:29:09,167 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:09,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:09,168 INFO L85 PathProgramCache]: Analyzing trace with hash 62640818, now seen corresponding path program 1 times [2022-07-12 10:29:09,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:09,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548476275] [2022-07-12 10:29:09,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:09,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:09,415 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:29:09,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:09,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548476275] [2022-07-12 10:29:09,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548476275] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:09,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731861271] [2022-07-12 10:29:09,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:09,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:09,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:09,423 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:29:09,424 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:29:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:09,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 10:29:09,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:09,535 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:29:09,681 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:29:09,682 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 11 treesize of output 11 [2022-07-12 10:29:09,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 10:29:09,950 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:29:09,993 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:29:10,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 10:29:10,122 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:29:10,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:10,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 10:29:10,369 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:29:10,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731861271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:10,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:10,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 9] total 30 [2022-07-12 10:29:10,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57512644] [2022-07-12 10:29:10,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:10,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 10:29:10,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:10,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 10:29:10,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2022-07-12 10:29:10,372 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 117 [2022-07-12 10:29:10,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 103 transitions, 274 flow. Second operand has 30 states, 30 states have (on average 49.266666666666666) internal successors, (1478), 30 states have internal predecessors, (1478), 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:29:10,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:10,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 117 [2022-07-12 10:29:10,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:11,038 INFO L129 PetriNetUnfolder]: 325/771 cut-off events. [2022-07-12 10:29:11,039 INFO L130 PetriNetUnfolder]: For 507/507 co-relation queries the response was YES. [2022-07-12 10:29:11,040 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 771 events. 325/771 cut-off events. For 507/507 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3846 event pairs, 99 based on Foata normal form. 1/761 useless extension candidates. Maximal degree in co-relation 1859. Up to 330 conditions per place. [2022-07-12 10:29:11,043 INFO L132 encePairwiseOnDemand]: 96/117 looper letters, 90 selfloop transitions, 29 changer transitions 4/162 dead transitions. [2022-07-12 10:29:11,043 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 162 transitions, 727 flow [2022-07-12 10:29:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 10:29:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-07-12 10:29:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1112 transitions. [2022-07-12 10:29:11,045 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.432012432012432 [2022-07-12 10:29:11,046 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1112 transitions. [2022-07-12 10:29:11,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1112 transitions. [2022-07-12 10:29:11,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:11,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1112 transitions. [2022-07-12 10:29:11,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 50.54545454545455) internal successors, (1112), 22 states have internal predecessors, (1112), 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:29:11,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 117.0) internal successors, (2691), 23 states have internal predecessors, (2691), 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:29:11,050 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 117.0) internal successors, (2691), 23 states have internal predecessors, (2691), 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:29:11,051 INFO L186 Difference]: Start difference. First operand has 115 places, 103 transitions, 274 flow. Second operand 22 states and 1112 transitions. [2022-07-12 10:29:11,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 162 transitions, 727 flow [2022-07-12 10:29:11,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 162 transitions, 709 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-07-12 10:29:11,054 INFO L242 Difference]: Finished difference. Result has 138 places, 118 transitions, 425 flow [2022-07-12 10:29:11,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=425, PETRI_PLACES=138, PETRI_TRANSITIONS=118} [2022-07-12 10:29:11,055 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 34 predicate places. [2022-07-12 10:29:11,055 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 118 transitions, 425 flow [2022-07-12 10:29:11,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 49.266666666666666) internal successors, (1478), 30 states have internal predecessors, (1478), 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:29:11,055 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:11,055 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] [2022-07-12 10:29:11,074 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:29:11,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:11,272 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash -618781634, now seen corresponding path program 2 times [2022-07-12 10:29:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:11,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017253662] [2022-07-12 10:29:11,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:11,551 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:29:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:11,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017253662] [2022-07-12 10:29:11,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017253662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:11,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949701570] [2022-07-12 10:29:11,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:29:11,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:11,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:11,553 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:29:11,554 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:29:11,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:29:11,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:11,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 10:29:11,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:11,651 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:29:11,770 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:29:11,770 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 11 treesize of output 11 [2022-07-12 10:29:11,900 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 11 treesize of output 7 [2022-07-12 10:29:12,062 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:29:12,114 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 21 treesize of output 21 [2022-07-12 10:29:12,203 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:29:12,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:12,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (= (+ c_~counter~0 (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base) c_~A~0.offset))) 0)) is different from false [2022-07-12 10:29:12,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0 (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base) c_~A~0.offset))) 0)) is different from false [2022-07-12 10:29:12,287 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (= 0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0 (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base) c_~A~0.offset))))) is different from false [2022-07-12 10:29:12,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145))) (+ (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~A~0.base) c_~A~0.offset)) c_~counter~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))) 0)) is different from false [2022-07-12 10:29:12,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145))) (+ c_~counter~0 (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|) (- 1)) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|))) 0)) is different from false [2022-07-12 10:29:12,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145))) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~counter~0 (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) 0)) is different from false [2022-07-12 10:29:12,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145))) (+ (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)) is different from false [2022-07-12 10:29:12,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:29:12,331 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 49 treesize of output 38 [2022-07-12 10:29:12,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 140 [2022-07-12 10:29:12,335 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 140 treesize of output 132 [2022-07-12 10:29:12,337 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 132 treesize of output 124 [2022-07-12 10:29:12,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 10:29:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 10:29:12,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949701570] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:12,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:12,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 17] total 38 [2022-07-12 10:29:12,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632125347] [2022-07-12 10:29:12,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:12,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 10:29:12,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:12,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 10:29:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=829, Unknown=7, NotChecked=448, Total=1406 [2022-07-12 10:29:12,679 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 117 [2022-07-12 10:29:12,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 118 transitions, 425 flow. Second operand has 38 states, 38 states have (on average 48.5) internal successors, (1843), 38 states have internal predecessors, (1843), 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:29:12,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:12,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 117 [2022-07-12 10:29:12,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:13,596 INFO L129 PetriNetUnfolder]: 471/1065 cut-off events. [2022-07-12 10:29:13,596 INFO L130 PetriNetUnfolder]: For 1207/1207 co-relation queries the response was YES. [2022-07-12 10:29:13,599 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 1065 events. 471/1065 cut-off events. For 1207/1207 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6186 event pairs, 49 based on Foata normal form. 1/1055 useless extension candidates. Maximal degree in co-relation 2931. Up to 352 conditions per place. [2022-07-12 10:29:13,602 INFO L132 encePairwiseOnDemand]: 96/117 looper letters, 104 selfloop transitions, 49 changer transitions 4/196 dead transitions. [2022-07-12 10:29:13,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 196 transitions, 1052 flow [2022-07-12 10:29:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 10:29:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-07-12 10:29:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1313 transitions. [2022-07-12 10:29:13,605 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.43162393162393164 [2022-07-12 10:29:13,605 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1313 transitions. [2022-07-12 10:29:13,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1313 transitions. [2022-07-12 10:29:13,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:13,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1313 transitions. [2022-07-12 10:29:13,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 50.5) internal successors, (1313), 26 states have internal predecessors, (1313), 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:29:13,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 117.0) internal successors, (3159), 27 states have internal predecessors, (3159), 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:29:13,611 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 117.0) internal successors, (3159), 27 states have internal predecessors, (3159), 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:29:13,611 INFO L186 Difference]: Start difference. First operand has 138 places, 118 transitions, 425 flow. Second operand 26 states and 1313 transitions. [2022-07-12 10:29:13,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 196 transitions, 1052 flow [2022-07-12 10:29:13,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 196 transitions, 976 flow, removed 20 selfloop flow, removed 14 redundant places. [2022-07-12 10:29:13,616 INFO L242 Difference]: Finished difference. Result has 151 places, 138 transitions, 619 flow [2022-07-12 10:29:13,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=619, PETRI_PLACES=151, PETRI_TRANSITIONS=138} [2022-07-12 10:29:13,619 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 47 predicate places. [2022-07-12 10:29:13,619 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 138 transitions, 619 flow [2022-07-12 10:29:13,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 48.5) internal successors, (1843), 38 states have internal predecessors, (1843), 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:29:13,620 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:13,620 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] [2022-07-12 10:29:13,656 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:29:13,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:13,837 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1246130652, now seen corresponding path program 3 times [2022-07-12 10:29:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:13,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11583132] [2022-07-12 10:29:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:14,244 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:29:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:14,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11583132] [2022-07-12 10:29:14,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11583132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:14,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535363911] [2022-07-12 10:29:14,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:29:14,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:14,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:14,246 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:29:14,247 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:29:14,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 10:29:14,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:14,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 10:29:14,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:14,543 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:29:14,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:14,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:29:14,595 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 24 treesize of output 25 [2022-07-12 10:29:14,666 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:29:14,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535363911] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:14,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:14,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 8] total 26 [2022-07-12 10:29:14,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511583501] [2022-07-12 10:29:14,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:14,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 10:29:14,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:14,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 10:29:14,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2022-07-12 10:29:14,669 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-12 10:29:14,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 138 transitions, 619 flow. Second operand has 26 states, 26 states have (on average 52.38461538461539) internal successors, (1362), 26 states have internal predecessors, (1362), 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:29:14,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:14,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-12 10:29:14,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:15,254 INFO L129 PetriNetUnfolder]: 586/1308 cut-off events. [2022-07-12 10:29:15,254 INFO L130 PetriNetUnfolder]: For 1953/1953 co-relation queries the response was YES. [2022-07-12 10:29:15,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 1308 events. 586/1308 cut-off events. For 1953/1953 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8300 event pairs, 146 based on Foata normal form. 1/1294 useless extension candidates. Maximal degree in co-relation 3787. Up to 784 conditions per place. [2022-07-12 10:29:15,262 INFO L132 encePairwiseOnDemand]: 96/117 looper letters, 112 selfloop transitions, 31 changer transitions 4/189 dead transitions. [2022-07-12 10:29:15,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 189 transitions, 1122 flow [2022-07-12 10:29:15,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 10:29:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-07-12 10:29:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1173 transitions. [2022-07-12 10:29:15,266 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4557109557109557 [2022-07-12 10:29:15,266 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1173 transitions. [2022-07-12 10:29:15,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1173 transitions. [2022-07-12 10:29:15,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:15,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1173 transitions. [2022-07-12 10:29:15,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 53.31818181818182) internal successors, (1173), 22 states have internal predecessors, (1173), 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:29:15,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 117.0) internal successors, (2691), 23 states have internal predecessors, (2691), 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:29:15,273 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 117.0) internal successors, (2691), 23 states have internal predecessors, (2691), 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:29:15,273 INFO L186 Difference]: Start difference. First operand has 151 places, 138 transitions, 619 flow. Second operand 22 states and 1173 transitions. [2022-07-12 10:29:15,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 189 transitions, 1122 flow [2022-07-12 10:29:15,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 189 transitions, 1028 flow, removed 32 selfloop flow, removed 14 redundant places. [2022-07-12 10:29:15,280 INFO L242 Difference]: Finished difference. Result has 161 places, 148 transitions, 693 flow [2022-07-12 10:29:15,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=693, PETRI_PLACES=161, PETRI_TRANSITIONS=148} [2022-07-12 10:29:15,281 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 57 predicate places. [2022-07-12 10:29:15,281 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 148 transitions, 693 flow [2022-07-12 10:29:15,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 52.38461538461539) internal successors, (1362), 26 states have internal predecessors, (1362), 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:29:15,282 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:15,282 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] [2022-07-12 10:29:15,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 10:29:15,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:15,496 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:15,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1270727132, now seen corresponding path program 4 times [2022-07-12 10:29:15,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:15,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554149472] [2022-07-12 10:29:15,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:15,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:15,723 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:29:15,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:15,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554149472] [2022-07-12 10:29:15,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554149472] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:15,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835798657] [2022-07-12 10:29:15,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 10:29:15,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:15,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:15,725 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:29:15,726 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:29:15,794 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 10:29:15,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:15,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 10:29:15,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:16,005 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 11 treesize of output 7 [2022-07-12 10:29:16,084 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:29:16,108 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:29:16,162 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:29:16,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:16,241 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:29:16,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835798657] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:16,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:16,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 8] total 27 [2022-07-12 10:29:16,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413898587] [2022-07-12 10:29:16,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:16,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 10:29:16,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:16,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 10:29:16,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2022-07-12 10:29:16,244 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-12 10:29:16,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 148 transitions, 693 flow. Second operand has 27 states, 27 states have (on average 52.22222222222222) internal successors, (1410), 27 states have internal predecessors, (1410), 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:29:16,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:16,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-12 10:29:16,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:16,871 INFO L129 PetriNetUnfolder]: 701/1574 cut-off events. [2022-07-12 10:29:16,872 INFO L130 PetriNetUnfolder]: For 2197/2197 co-relation queries the response was YES. [2022-07-12 10:29:16,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 1574 events. 701/1574 cut-off events. For 2197/2197 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10496 event pairs, 231 based on Foata normal form. 1/1556 useless extension candidates. Maximal degree in co-relation 4489. Up to 806 conditions per place. [2022-07-12 10:29:16,895 INFO L132 encePairwiseOnDemand]: 96/117 looper letters, 115 selfloop transitions, 45 changer transitions 4/206 dead transitions. [2022-07-12 10:29:16,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 206 transitions, 1261 flow [2022-07-12 10:29:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 10:29:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-12 10:29:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1275 transitions. [2022-07-12 10:29:16,897 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.45405982905982906 [2022-07-12 10:29:16,897 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1275 transitions. [2022-07-12 10:29:16,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1275 transitions. [2022-07-12 10:29:16,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:16,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1275 transitions. [2022-07-12 10:29:16,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 53.125) internal successors, (1275), 24 states have internal predecessors, (1275), 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:29:16,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 117.0) internal successors, (2925), 25 states have internal predecessors, (2925), 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:29:16,902 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 117.0) internal successors, (2925), 25 states have internal predecessors, (2925), 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:29:16,902 INFO L186 Difference]: Start difference. First operand has 161 places, 148 transitions, 693 flow. Second operand 24 states and 1275 transitions. [2022-07-12 10:29:16,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 206 transitions, 1261 flow [2022-07-12 10:29:16,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 206 transitions, 1195 flow, removed 11 selfloop flow, removed 16 redundant places. [2022-07-12 10:29:16,909 INFO L242 Difference]: Finished difference. Result has 169 places, 161 transitions, 840 flow [2022-07-12 10:29:16,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=840, PETRI_PLACES=169, PETRI_TRANSITIONS=161} [2022-07-12 10:29:16,909 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 65 predicate places. [2022-07-12 10:29:16,910 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 161 transitions, 840 flow [2022-07-12 10:29:16,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 52.22222222222222) internal successors, (1410), 27 states have internal predecessors, (1410), 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:29:16,910 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:16,910 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] [2022-07-12 10:29:16,943 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:29:17,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:17,127 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:17,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:17,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1059485982, now seen corresponding path program 5 times [2022-07-12 10:29:17,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:17,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399223939] [2022-07-12 10:29:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:17,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:17,346 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:29:17,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:17,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399223939] [2022-07-12 10:29:17,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399223939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:17,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331354027] [2022-07-12 10:29:17,347 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 10:29:17,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:17,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:17,348 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:29:17,365 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:29:17,431 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:29:17,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:17,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 10:29:17,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:17,611 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 11 treesize of output 7 [2022-07-12 10:29:17,732 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:29:17,771 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:29:17,858 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:29:17,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:17,989 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:29:17,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331354027] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:17,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:17,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 8] total 28 [2022-07-12 10:29:17,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854718235] [2022-07-12 10:29:17,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:17,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 10:29:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:17,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 10:29:17,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2022-07-12 10:29:17,991 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-12 10:29:17,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 161 transitions, 840 flow. Second operand has 28 states, 28 states have (on average 52.107142857142854) internal successors, (1459), 28 states have internal predecessors, (1459), 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:29:17,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:17,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-12 10:29:17,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:18,701 INFO L129 PetriNetUnfolder]: 831/1856 cut-off events. [2022-07-12 10:29:18,701 INFO L130 PetriNetUnfolder]: For 3366/3366 co-relation queries the response was YES. [2022-07-12 10:29:18,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5581 conditions, 1856 events. 831/1856 cut-off events. For 3366/3366 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12821 event pairs, 244 based on Foata normal form. 1/1842 useless extension candidates. Maximal degree in co-relation 5556. Up to 832 conditions per place. [2022-07-12 10:29:18,712 INFO L132 encePairwiseOnDemand]: 96/117 looper letters, 120 selfloop transitions, 61 changer transitions 4/227 dead transitions. [2022-07-12 10:29:18,712 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 227 transitions, 1523 flow [2022-07-12 10:29:18,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 10:29:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-07-12 10:29:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1380 transitions. [2022-07-12 10:29:18,716 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4536489151873767 [2022-07-12 10:29:18,716 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1380 transitions. [2022-07-12 10:29:18,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1380 transitions. [2022-07-12 10:29:18,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:18,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1380 transitions. [2022-07-12 10:29:18,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 53.07692307692308) internal successors, (1380), 26 states have internal predecessors, (1380), 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:29:18,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 117.0) internal successors, (3159), 27 states have internal predecessors, (3159), 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:29:18,724 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 117.0) internal successors, (3159), 27 states have internal predecessors, (3159), 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:29:18,724 INFO L186 Difference]: Start difference. First operand has 169 places, 161 transitions, 840 flow. Second operand 26 states and 1380 transitions. [2022-07-12 10:29:18,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 227 transitions, 1523 flow [2022-07-12 10:29:18,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 227 transitions, 1396 flow, removed 45 selfloop flow, removed 16 redundant places. [2022-07-12 10:29:18,735 INFO L242 Difference]: Finished difference. Result has 179 places, 177 transitions, 1020 flow [2022-07-12 10:29:18,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1020, PETRI_PLACES=179, PETRI_TRANSITIONS=177} [2022-07-12 10:29:18,736 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 75 predicate places. [2022-07-12 10:29:18,736 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 177 transitions, 1020 flow [2022-07-12 10:29:18,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 52.107142857142854) internal successors, (1459), 28 states have internal predecessors, (1459), 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:29:18,736 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:18,737 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:18,753 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:29:18,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:18,953 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:18,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:18,954 INFO L85 PathProgramCache]: Analyzing trace with hash -836879962, now seen corresponding path program 6 times [2022-07-12 10:29:18,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:18,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137741099] [2022-07-12 10:29:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:29:19,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:19,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137741099] [2022-07-12 10:29:19,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137741099] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:19,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615821218] [2022-07-12 10:29:19,037 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 10:29:19,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:19,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:19,038 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:29:19,039 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:29:19,112 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-12 10:29:19,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:19,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 10:29:19,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:29:19,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:29:19,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615821218] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:19,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:19,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-07-12 10:29:19,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880812429] [2022-07-12 10:29:19,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:19,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 10:29:19,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:19,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 10:29:19,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:29:19,372 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 117 [2022-07-12 10:29:19,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 177 transitions, 1020 flow. Second operand has 24 states, 24 states have (on average 83.75) internal successors, (2010), 24 states have internal predecessors, (2010), 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:29:19,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:19,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 117 [2022-07-12 10:29:19,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:19,782 INFO L129 PetriNetUnfolder]: 416/1418 cut-off events. [2022-07-12 10:29:19,782 INFO L130 PetriNetUnfolder]: For 2331/2349 co-relation queries the response was YES. [2022-07-12 10:29:19,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 1418 events. 416/1418 cut-off events. For 2331/2349 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10225 event pairs, 113 based on Foata normal form. 41/1442 useless extension candidates. Maximal degree in co-relation 4097. Up to 383 conditions per place. [2022-07-12 10:29:19,791 INFO L132 encePairwiseOnDemand]: 101/117 looper letters, 174 selfloop transitions, 33 changer transitions 0/292 dead transitions. [2022-07-12 10:29:19,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 292 transitions, 2234 flow [2022-07-12 10:29:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:29:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:29:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1370 transitions. [2022-07-12 10:29:19,793 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7318376068376068 [2022-07-12 10:29:19,793 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1370 transitions. [2022-07-12 10:29:19,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1370 transitions. [2022-07-12 10:29:19,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:19,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1370 transitions. [2022-07-12 10:29:19,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.625) internal successors, (1370), 16 states have internal predecessors, (1370), 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:29:19,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 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:29:19,798 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 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:29:19,798 INFO L186 Difference]: Start difference. First operand has 179 places, 177 transitions, 1020 flow. Second operand 16 states and 1370 transitions. [2022-07-12 10:29:19,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 292 transitions, 2234 flow [2022-07-12 10:29:19,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 292 transitions, 2048 flow, removed 55 selfloop flow, removed 19 redundant places. [2022-07-12 10:29:19,808 INFO L242 Difference]: Finished difference. Result has 182 places, 203 transitions, 1270 flow [2022-07-12 10:29:19,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1270, PETRI_PLACES=182, PETRI_TRANSITIONS=203} [2022-07-12 10:29:19,809 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 78 predicate places. [2022-07-12 10:29:19,810 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 203 transitions, 1270 flow [2022-07-12 10:29:19,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 83.75) internal successors, (2010), 24 states have internal predecessors, (2010), 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:29:19,820 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:19,821 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:19,837 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:29:20,037 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,SelfDestructingSolverStorable11 [2022-07-12 10:29:20,037 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:20,038 INFO L85 PathProgramCache]: Analyzing trace with hash 447763680, now seen corresponding path program 7 times [2022-07-12 10:29:20,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:20,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45754691] [2022-07-12 10:29:20,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:20,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:20,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45754691] [2022-07-12 10:29:20,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45754691] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:20,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133812909] [2022-07-12 10:29:20,109 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 10:29:20,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:20,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:20,124 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:29:20,161 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:29:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:20,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 10:29:20,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:20,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:20,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133812909] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:20,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:20,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-07-12 10:29:20,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872923300] [2022-07-12 10:29:20,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:20,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 10:29:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:20,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 10:29:20,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:29:20,437 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 117 [2022-07-12 10:29:20,439 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 203 transitions, 1270 flow. Second operand has 24 states, 24 states have (on average 83.75) internal successors, (2010), 24 states have internal predecessors, (2010), 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:29:20,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:20,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 117 [2022-07-12 10:29:20,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:20,799 INFO L129 PetriNetUnfolder]: 351/1201 cut-off events. [2022-07-12 10:29:20,799 INFO L130 PetriNetUnfolder]: For 2100/2138 co-relation queries the response was YES. [2022-07-12 10:29:20,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3682 conditions, 1201 events. 351/1201 cut-off events. For 2100/2138 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8505 event pairs, 135 based on Foata normal form. 62/1250 useless extension candidates. Maximal degree in co-relation 3650. Up to 453 conditions per place. [2022-07-12 10:29:20,818 INFO L132 encePairwiseOnDemand]: 101/117 looper letters, 101 selfloop transitions, 12 changer transitions 80/277 dead transitions. [2022-07-12 10:29:20,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 277 transitions, 2102 flow [2022-07-12 10:29:20,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:29:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:29:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1370 transitions. [2022-07-12 10:29:20,820 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7318376068376068 [2022-07-12 10:29:20,820 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1370 transitions. [2022-07-12 10:29:20,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1370 transitions. [2022-07-12 10:29:20,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:20,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1370 transitions. [2022-07-12 10:29:20,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.625) internal successors, (1370), 16 states have internal predecessors, (1370), 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:29:20,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 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:29:20,825 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 117.0) internal successors, (1989), 17 states have internal predecessors, (1989), 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:29:20,825 INFO L186 Difference]: Start difference. First operand has 182 places, 203 transitions, 1270 flow. Second operand 16 states and 1370 transitions. [2022-07-12 10:29:20,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 277 transitions, 2102 flow [2022-07-12 10:29:20,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 277 transitions, 2083 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-07-12 10:29:20,836 INFO L242 Difference]: Finished difference. Result has 198 places, 181 transitions, 1054 flow [2022-07-12 10:29:20,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1054, PETRI_PLACES=198, PETRI_TRANSITIONS=181} [2022-07-12 10:29:20,837 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 94 predicate places. [2022-07-12 10:29:20,837 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 181 transitions, 1054 flow [2022-07-12 10:29:20,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 83.75) internal successors, (2010), 24 states have internal predecessors, (2010), 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:29:20,838 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:20,838 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:20,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 10:29:21,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 10:29:21,054 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:21,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1322365107, now seen corresponding path program 8 times [2022-07-12 10:29:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:21,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647601416] [2022-07-12 10:29:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:21,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 10:29:21,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:21,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647601416] [2022-07-12 10:29:21,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647601416] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:21,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574442764] [2022-07-12 10:29:21,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:29:21,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:21,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:21,164 INFO L229 MonitoredProcess]: Starting monitored process 11 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:29:21,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 10:29:21,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:29:21,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:21,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:29:21,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:29:21,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:29:21,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574442764] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:21,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:21,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-07-12 10:29:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915689254] [2022-07-12 10:29:21,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:21,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 10:29:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:21,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 10:29:21,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-07-12 10:29:21,368 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 117 [2022-07-12 10:29:21,369 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 181 transitions, 1054 flow. Second operand has 19 states, 19 states have (on average 80.78947368421052) internal successors, (1535), 19 states have internal predecessors, (1535), 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:29:21,369 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:21,369 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 117 [2022-07-12 10:29:21,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:22,204 INFO L129 PetriNetUnfolder]: 427/1012 cut-off events. [2022-07-12 10:29:22,204 INFO L130 PetriNetUnfolder]: For 2446/2446 co-relation queries the response was YES. [2022-07-12 10:29:22,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 1012 events. 427/1012 cut-off events. For 2446/2446 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5229 event pairs, 10 based on Foata normal form. 49/1059 useless extension candidates. Maximal degree in co-relation 3806. Up to 165 conditions per place. [2022-07-12 10:29:22,211 INFO L132 encePairwiseOnDemand]: 99/117 looper letters, 173 selfloop transitions, 117 changer transitions 0/354 dead transitions. [2022-07-12 10:29:22,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 354 transitions, 2806 flow [2022-07-12 10:29:22,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 10:29:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-07-12 10:29:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3191 transitions. [2022-07-12 10:29:22,214 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6993206223975454 [2022-07-12 10:29:22,214 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3191 transitions. [2022-07-12 10:29:22,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3191 transitions. [2022-07-12 10:29:22,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:22,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3191 transitions. [2022-07-12 10:29:22,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 81.82051282051282) internal successors, (3191), 39 states have internal predecessors, (3191), 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:29:22,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 117.0) internal successors, (4680), 40 states have internal predecessors, (4680), 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:29:22,223 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 117.0) internal successors, (4680), 40 states have internal predecessors, (4680), 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:29:22,224 INFO L186 Difference]: Start difference. First operand has 198 places, 181 transitions, 1054 flow. Second operand 39 states and 3191 transitions. [2022-07-12 10:29:22,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 354 transitions, 2806 flow [2022-07-12 10:29:22,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 354 transitions, 2479 flow, removed 127 selfloop flow, removed 22 redundant places. [2022-07-12 10:29:22,236 INFO L242 Difference]: Finished difference. Result has 225 places, 251 transitions, 1785 flow [2022-07-12 10:29:22,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1785, PETRI_PLACES=225, PETRI_TRANSITIONS=251} [2022-07-12 10:29:22,237 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 121 predicate places. [2022-07-12 10:29:22,237 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 251 transitions, 1785 flow [2022-07-12 10:29:22,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 80.78947368421052) internal successors, (1535), 19 states have internal predecessors, (1535), 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:29:22,238 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:22,238 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:22,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 10:29:22,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 10:29:22,455 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash -823728965, now seen corresponding path program 9 times [2022-07-12 10:29:22,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:22,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466668470] [2022-07-12 10:29:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:22,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 10:29:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:22,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466668470] [2022-07-12 10:29:22,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466668470] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:22,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767248357] [2022-07-12 10:29:22,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:29:22,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:22,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:22,531 INFO L229 MonitoredProcess]: Starting monitored process 12 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:29:22,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 10:29:22,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 10:29:22,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:22,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 10:29:22,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 10:29:22,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 10:29:22,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767248357] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:22,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:22,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-07-12 10:29:22,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182827923] [2022-07-12 10:29:22,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:22,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 10:29:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:22,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 10:29:22,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-07-12 10:29:22,927 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 117 [2022-07-12 10:29:22,928 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 251 transitions, 1785 flow. Second operand has 24 states, 24 states have (on average 83.95833333333333) internal successors, (2015), 24 states have internal predecessors, (2015), 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:29:22,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:22,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 117 [2022-07-12 10:29:22,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:23,236 INFO L129 PetriNetUnfolder]: 310/826 cut-off events. [2022-07-12 10:29:23,236 INFO L130 PetriNetUnfolder]: For 4356/4380 co-relation queries the response was YES. [2022-07-12 10:29:23,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3723 conditions, 826 events. 310/826 cut-off events. For 4356/4380 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3903 event pairs, 39 based on Foata normal form. 35/850 useless extension candidates. Maximal degree in co-relation 3679. Up to 171 conditions per place. [2022-07-12 10:29:23,243 INFO L132 encePairwiseOnDemand]: 104/117 looper letters, 137 selfloop transitions, 57 changer transitions 0/312 dead transitions. [2022-07-12 10:29:23,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 312 transitions, 2625 flow [2022-07-12 10:29:23,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:29:23,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-12 10:29:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1280 transitions. [2022-07-12 10:29:23,246 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7293447293447294 [2022-07-12 10:29:23,246 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1280 transitions. [2022-07-12 10:29:23,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1280 transitions. [2022-07-12 10:29:23,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:23,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1280 transitions. [2022-07-12 10:29:23,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 85.33333333333333) internal successors, (1280), 15 states have internal predecessors, (1280), 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:29:23,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 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:29:23,251 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 117.0) internal successors, (1872), 16 states have internal predecessors, (1872), 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:29:23,251 INFO L186 Difference]: Start difference. First operand has 225 places, 251 transitions, 1785 flow. Second operand 15 states and 1280 transitions. [2022-07-12 10:29:23,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 312 transitions, 2625 flow [2022-07-12 10:29:23,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 312 transitions, 2590 flow, removed 6 selfloop flow, removed 10 redundant places. [2022-07-12 10:29:23,269 INFO L242 Difference]: Finished difference. Result has 232 places, 259 transitions, 1984 flow [2022-07-12 10:29:23,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1984, PETRI_PLACES=232, PETRI_TRANSITIONS=259} [2022-07-12 10:29:23,269 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 128 predicate places. [2022-07-12 10:29:23,269 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 259 transitions, 1984 flow [2022-07-12 10:29:23,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 83.95833333333333) internal successors, (2015), 24 states have internal predecessors, (2015), 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:29:23,270 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:23,270 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:23,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 10:29:23,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 10:29:23,484 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:23,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash -459984071, now seen corresponding path program 10 times [2022-07-12 10:29:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:23,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502679047] [2022-07-12 10:29:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:24,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:24,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502679047] [2022-07-12 10:29:24,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502679047] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:24,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571292429] [2022-07-12 10:29:24,282 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 10:29:24,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:24,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:24,293 INFO L229 MonitoredProcess]: Starting monitored process 13 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:29:24,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 10:29:24,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 10:29:24,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:24,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-12 10:29:24,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:24,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:29:24,868 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 18 treesize of output 20 [2022-07-12 10:29:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:25,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:25,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_359) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) (* (- 1) (select .cse0 c_~A~0.offset)) (* (select .cse0 (+ c_~A~0.offset 4)) (- 1)) c_~counter~0)) 0)) is different from false [2022-07-12 10:29:25,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_359) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (* (select .cse0 (+ c_~A~0.offset 4)) (- 1)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) c_~counter~0)) 0)) is different from false [2022-07-12 10:29:25,362 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-12 10:29:25,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2022-07-12 10:29:25,379 INFO L356 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-07-12 10:29:25,379 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 29 treesize of output 39 [2022-07-12 10:29:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-07-12 10:29:25,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571292429] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:25,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:25,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 23, 21] total 61 [2022-07-12 10:29:25,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274846671] [2022-07-12 10:29:25,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:25,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-12 10:29:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:25,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-12 10:29:25,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3220, Unknown=2, NotChecked=230, Total=3660 [2022-07-12 10:29:25,789 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2022-07-12 10:29:25,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 259 transitions, 1984 flow. Second operand has 61 states, 61 states have (on average 43.90163934426229) internal successors, (2678), 61 states have internal predecessors, (2678), 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:29:25,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:25,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2022-07-12 10:29:25,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:29,246 INFO L129 PetriNetUnfolder]: 1948/3543 cut-off events. [2022-07-12 10:29:29,246 INFO L130 PetriNetUnfolder]: For 17319/17319 co-relation queries the response was YES. [2022-07-12 10:29:29,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16097 conditions, 3543 events. 1948/3543 cut-off events. For 17319/17319 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22845 event pairs, 145 based on Foata normal form. 1/3533 useless extension candidates. Maximal degree in co-relation 16054. Up to 2096 conditions per place. [2022-07-12 10:29:29,330 INFO L132 encePairwiseOnDemand]: 83/117 looper letters, 394 selfloop transitions, 144 changer transitions 4/577 dead transitions. [2022-07-12 10:29:29,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 577 transitions, 5247 flow [2022-07-12 10:29:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-12 10:29:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-07-12 10:29:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 2573 transitions. [2022-07-12 10:29:29,341 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.39984459984459986 [2022-07-12 10:29:29,342 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 2573 transitions. [2022-07-12 10:29:29,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 2573 transitions. [2022-07-12 10:29:29,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:29,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 2573 transitions. [2022-07-12 10:29:29,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 46.78181818181818) internal successors, (2573), 55 states have internal predecessors, (2573), 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:29:29,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 117.0) internal successors, (6552), 56 states have internal predecessors, (6552), 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:29:29,358 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 117.0) internal successors, (6552), 56 states have internal predecessors, (6552), 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:29:29,359 INFO L186 Difference]: Start difference. First operand has 232 places, 259 transitions, 1984 flow. Second operand 55 states and 2573 transitions. [2022-07-12 10:29:29,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 577 transitions, 5247 flow [2022-07-12 10:29:29,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 577 transitions, 5107 flow, removed 14 selfloop flow, removed 12 redundant places. [2022-07-12 10:29:29,409 INFO L242 Difference]: Finished difference. Result has 290 places, 371 transitions, 3266 flow [2022-07-12 10:29:29,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=3266, PETRI_PLACES=290, PETRI_TRANSITIONS=371} [2022-07-12 10:29:29,410 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 186 predicate places. [2022-07-12 10:29:29,410 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 371 transitions, 3266 flow [2022-07-12 10:29:29,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 43.90163934426229) internal successors, (2678), 61 states have internal predecessors, (2678), 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:29:29,411 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:29,411 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:29,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 10:29:29,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 10:29:29,647 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:29,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:29,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1705508623, now seen corresponding path program 11 times [2022-07-12 10:29:29,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:29,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954019552] [2022-07-12 10:29:29,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:29,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:30,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:30,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954019552] [2022-07-12 10:29:30,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954019552] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:30,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681599234] [2022-07-12 10:29:30,212 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 10:29:30,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:30,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:30,213 INFO L229 MonitoredProcess]: Starting monitored process 14 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:29:30,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 10:29:30,301 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-12 10:29:30,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:30,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-12 10:29:30,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:30,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:31,018 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-12 10:29:31,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 55 [2022-07-12 10:29:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:29:31,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681599234] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:31,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:31,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21, 14] total 49 [2022-07-12 10:29:31,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576193366] [2022-07-12 10:29:31,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:31,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 10:29:31,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:31,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 10:29:31,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2181, Unknown=0, NotChecked=0, Total=2352 [2022-07-12 10:29:31,127 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-12 10:29:31,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 371 transitions, 3266 flow. Second operand has 49 states, 49 states have (on average 51.326530612244895) internal successors, (2515), 49 states have internal predecessors, (2515), 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:29:31,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:31,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-12 10:29:31,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:33,753 INFO L129 PetriNetUnfolder]: 2510/4582 cut-off events. [2022-07-12 10:29:33,753 INFO L130 PetriNetUnfolder]: For 26191/26194 co-relation queries the response was YES. [2022-07-12 10:29:33,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23108 conditions, 4582 events. 2510/4582 cut-off events. For 26191/26194 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 31395 event pairs, 439 based on Foata normal form. 1/4552 useless extension candidates. Maximal degree in co-relation 23052. Up to 3125 conditions per place. [2022-07-12 10:29:33,794 INFO L132 encePairwiseOnDemand]: 88/117 looper letters, 450 selfloop transitions, 146 changer transitions 4/638 dead transitions. [2022-07-12 10:29:33,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 638 transitions, 6626 flow [2022-07-12 10:29:33,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-12 10:29:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-07-12 10:29:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 2942 transitions. [2022-07-12 10:29:33,801 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.45718725718725717 [2022-07-12 10:29:33,802 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 2942 transitions. [2022-07-12 10:29:33,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 2942 transitions. [2022-07-12 10:29:33,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:33,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 2942 transitions. [2022-07-12 10:29:33,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 53.49090909090909) internal successors, (2942), 55 states have internal predecessors, (2942), 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:29:33,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 117.0) internal successors, (6552), 56 states have internal predecessors, (6552), 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:29:33,881 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 117.0) internal successors, (6552), 56 states have internal predecessors, (6552), 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:29:33,881 INFO L186 Difference]: Start difference. First operand has 290 places, 371 transitions, 3266 flow. Second operand 55 states and 2942 transitions. [2022-07-12 10:29:33,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 638 transitions, 6626 flow [2022-07-12 10:29:33,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 638 transitions, 6462 flow, removed 68 selfloop flow, removed 14 redundant places. [2022-07-12 10:29:33,966 INFO L242 Difference]: Finished difference. Result has 352 places, 451 transitions, 4562 flow [2022-07-12 10:29:33,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=3160, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=4562, PETRI_PLACES=352, PETRI_TRANSITIONS=451} [2022-07-12 10:29:33,967 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 248 predicate places. [2022-07-12 10:29:33,967 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 451 transitions, 4562 flow [2022-07-12 10:29:33,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 51.326530612244895) internal successors, (2515), 49 states have internal predecessors, (2515), 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:29:33,968 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:33,968 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:33,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 10:29:34,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 10:29:34,186 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash 922626737, now seen corresponding path program 12 times [2022-07-12 10:29:34,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:34,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190168351] [2022-07-12 10:29:34,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:34,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:34,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:34,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190168351] [2022-07-12 10:29:34,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190168351] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:34,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784187471] [2022-07-12 10:29:34,721 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 10:29:34,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:34,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:34,732 INFO L229 MonitoredProcess]: Starting monitored process 15 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:29:34,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 10:29:34,960 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-12 10:29:34,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:34,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-12 10:29:34,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:35,281 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 13 treesize of output 9 [2022-07-12 10:29:35,370 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:29:35,451 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:29:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:35,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:35,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_419) c_~A~0.base)) (.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset .cse1 4)))) 0)) is different from false [2022-07-12 10:29:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:29:35,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784187471] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:35,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:35,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 15] total 59 [2022-07-12 10:29:35,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579302787] [2022-07-12 10:29:35,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:35,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-12 10:29:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:35,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-12 10:29:36,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3108, Unknown=1, NotChecked=112, Total=3422 [2022-07-12 10:29:36,001 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2022-07-12 10:29:36,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 451 transitions, 4562 flow. Second operand has 59 states, 59 states have (on average 44.03389830508475) internal successors, (2598), 59 states have internal predecessors, (2598), 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:29:36,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:36,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2022-07-12 10:29:36,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:39,537 INFO L129 PetriNetUnfolder]: 2927/5346 cut-off events. [2022-07-12 10:29:39,538 INFO L130 PetriNetUnfolder]: For 35445/35466 co-relation queries the response was YES. [2022-07-12 10:29:39,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28389 conditions, 5346 events. 2927/5346 cut-off events. For 35445/35466 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 37839 event pairs, 518 based on Foata normal form. 15/5331 useless extension candidates. Maximal degree in co-relation 28310. Up to 3726 conditions per place. [2022-07-12 10:29:39,589 INFO L132 encePairwiseOnDemand]: 82/117 looper letters, 504 selfloop transitions, 208 changer transitions 4/751 dead transitions. [2022-07-12 10:29:39,589 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 751 transitions, 8468 flow [2022-07-12 10:29:39,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-12 10:29:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2022-07-12 10:29:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 3244 transitions. [2022-07-12 10:29:39,595 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3960927960927961 [2022-07-12 10:29:39,595 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 3244 transitions. [2022-07-12 10:29:39,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 3244 transitions. [2022-07-12 10:29:39,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:39,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 3244 transitions. [2022-07-12 10:29:39,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 46.34285714285714) internal successors, (3244), 70 states have internal predecessors, (3244), 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:29:39,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 117.0) internal successors, (8307), 71 states have internal predecessors, (8307), 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:29:39,609 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 117.0) internal successors, (8307), 71 states have internal predecessors, (8307), 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:29:39,609 INFO L186 Difference]: Start difference. First operand has 352 places, 451 transitions, 4562 flow. Second operand 70 states and 3244 transitions. [2022-07-12 10:29:39,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 751 transitions, 8468 flow [2022-07-12 10:29:39,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 751 transitions, 8331 flow, removed 33 selfloop flow, removed 26 redundant places. [2022-07-12 10:29:39,748 INFO L242 Difference]: Finished difference. Result has 408 places, 541 transitions, 6001 flow [2022-07-12 10:29:39,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4433, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=6001, PETRI_PLACES=408, PETRI_TRANSITIONS=541} [2022-07-12 10:29:39,749 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 304 predicate places. [2022-07-12 10:29:39,749 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 541 transitions, 6001 flow [2022-07-12 10:29:39,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 44.03389830508475) internal successors, (2598), 59 states have internal predecessors, (2598), 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:29:39,749 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:39,750 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:39,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 10:29:39,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:39,967 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1149062991, now seen corresponding path program 13 times [2022-07-12 10:29:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:39,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109848625] [2022-07-12 10:29:39,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:40,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:40,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109848625] [2022-07-12 10:29:40,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109848625] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:40,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464900194] [2022-07-12 10:29:40,518 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 10:29:40,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:40,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:40,521 INFO L229 MonitoredProcess]: Starting monitored process 16 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:29:40,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 10:29:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:40,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-12 10:29:40,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:29:40,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:41,146 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-12 10:29:41,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 55 [2022-07-12 10:29:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:29:41,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464900194] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:41,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:41,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16, 14] total 47 [2022-07-12 10:29:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145793077] [2022-07-12 10:29:41,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:41,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-12 10:29:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:41,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-12 10:29:41,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2003, Unknown=0, NotChecked=0, Total=2162 [2022-07-12 10:29:41,261 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-12 10:29:41,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 541 transitions, 6001 flow. Second operand has 47 states, 47 states have (on average 50.97872340425532) internal successors, (2396), 47 states have internal predecessors, (2396), 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:29:41,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:41,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-12 10:29:41,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:44,420 INFO L129 PetriNetUnfolder]: 3440/6268 cut-off events. [2022-07-12 10:29:44,420 INFO L130 PetriNetUnfolder]: For 59767/59834 co-relation queries the response was YES. [2022-07-12 10:29:44,461 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38625 conditions, 6268 events. 3440/6268 cut-off events. For 59767/59834 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 45820 event pairs, 595 based on Foata normal form. 21/6258 useless extension candidates. Maximal degree in co-relation 38532. Up to 4025 conditions per place. [2022-07-12 10:29:44,483 INFO L132 encePairwiseOnDemand]: 88/117 looper letters, 539 selfloop transitions, 253 changer transitions 4/834 dead transitions. [2022-07-12 10:29:44,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 834 transitions, 10660 flow [2022-07-12 10:29:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-12 10:29:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-07-12 10:29:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 3377 transitions. [2022-07-12 10:29:44,487 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4581467914801248 [2022-07-12 10:29:44,487 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 3377 transitions. [2022-07-12 10:29:44,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 3377 transitions. [2022-07-12 10:29:44,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:44,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 3377 transitions. [2022-07-12 10:29:44,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 53.6031746031746) internal successors, (3377), 63 states have internal predecessors, (3377), 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:29:44,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 117.0) internal successors, (7488), 64 states have internal predecessors, (7488), 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:29:44,497 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 117.0) internal successors, (7488), 64 states have internal predecessors, (7488), 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:29:44,497 INFO L186 Difference]: Start difference. First operand has 408 places, 541 transitions, 6001 flow. Second operand 63 states and 3377 transitions. [2022-07-12 10:29:44,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 834 transitions, 10660 flow [2022-07-12 10:29:44,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 834 transitions, 10179 flow, removed 149 selfloop flow, removed 42 redundant places. [2022-07-12 10:29:44,745 INFO L242 Difference]: Finished difference. Result has 438 places, 616 transitions, 7211 flow [2022-07-12 10:29:44,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=5570, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=7211, PETRI_PLACES=438, PETRI_TRANSITIONS=616} [2022-07-12 10:29:44,745 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 334 predicate places. [2022-07-12 10:29:44,746 INFO L495 AbstractCegarLoop]: Abstraction has has 438 places, 616 transitions, 7211 flow [2022-07-12 10:29:44,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 50.97872340425532) internal successors, (2396), 47 states have internal predecessors, (2396), 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:29:44,746 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:44,746 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:44,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 10:29:44,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:44,957 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:44,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1238531119, now seen corresponding path program 14 times [2022-07-12 10:29:44,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:44,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308850336] [2022-07-12 10:29:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:44,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:45,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:45,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308850336] [2022-07-12 10:29:45,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308850336] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:45,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229348858] [2022-07-12 10:29:45,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:29:45,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:45,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:45,489 INFO L229 MonitoredProcess]: Starting monitored process 17 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:29:45,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 10:29:45,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:29:45,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:45,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-12 10:29:45,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:29:45,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:46,236 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-12 10:29:46,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 55 [2022-07-12 10:29:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:29:46,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229348858] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:46,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:46,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19, 14] total 48 [2022-07-12 10:29:46,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847788625] [2022-07-12 10:29:46,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:46,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-12 10:29:46,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:46,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-12 10:29:46,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2091, Unknown=0, NotChecked=0, Total=2256 [2022-07-12 10:29:46,348 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 117 [2022-07-12 10:29:46,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 616 transitions, 7211 flow. Second operand has 48 states, 48 states have (on average 51.1875) internal successors, (2457), 48 states have internal predecessors, (2457), 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:29:46,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:46,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 117 [2022-07-12 10:29:46,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:29:49,527 INFO L129 PetriNetUnfolder]: 3680/6721 cut-off events. [2022-07-12 10:29:49,527 INFO L130 PetriNetUnfolder]: For 74160/74223 co-relation queries the response was YES. [2022-07-12 10:29:49,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42934 conditions, 6721 events. 3680/6721 cut-off events. For 74160/74223 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 49923 event pairs, 751 based on Foata normal form. 20/6701 useless extension candidates. Maximal degree in co-relation 42830. Up to 4753 conditions per place. [2022-07-12 10:29:49,612 INFO L132 encePairwiseOnDemand]: 88/117 looper letters, 563 selfloop transitions, 231 changer transitions 4/836 dead transitions. [2022-07-12 10:29:49,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 836 transitions, 11231 flow [2022-07-12 10:29:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-12 10:29:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-07-12 10:29:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 2986 transitions. [2022-07-12 10:29:49,616 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.45573870573870573 [2022-07-12 10:29:49,616 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 2986 transitions. [2022-07-12 10:29:49,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 2986 transitions. [2022-07-12 10:29:49,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:29:49,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 2986 transitions. [2022-07-12 10:29:49,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 53.32142857142857) internal successors, (2986), 56 states have internal predecessors, (2986), 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:29:49,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 117.0) internal successors, (6669), 57 states have internal predecessors, (6669), 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:29:49,624 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 117.0) internal successors, (6669), 57 states have internal predecessors, (6669), 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:29:49,624 INFO L186 Difference]: Start difference. First operand has 438 places, 616 transitions, 7211 flow. Second operand 56 states and 2986 transitions. [2022-07-12 10:29:49,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 836 transitions, 11231 flow [2022-07-12 10:29:49,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 836 transitions, 10805 flow, removed 136 selfloop flow, removed 30 redundant places. [2022-07-12 10:29:49,978 INFO L242 Difference]: Finished difference. Result has 470 places, 652 transitions, 8111 flow [2022-07-12 10:29:49,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=6841, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=8111, PETRI_PLACES=470, PETRI_TRANSITIONS=652} [2022-07-12 10:29:49,979 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 366 predicate places. [2022-07-12 10:29:49,980 INFO L495 AbstractCegarLoop]: Abstraction has has 470 places, 652 transitions, 8111 flow [2022-07-12 10:29:49,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 51.1875) internal successors, (2457), 48 states have internal predecessors, (2457), 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:29:49,980 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:29:49,980 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:49,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 10:29:50,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:50,197 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:29:50,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:29:50,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1132419989, now seen corresponding path program 15 times [2022-07-12 10:29:50,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:29:50,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030146252] [2022-07-12 10:29:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:29:50,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:29:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:29:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:50,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:29:50,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030146252] [2022-07-12 10:29:50,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030146252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:29:50,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992689236] [2022-07-12 10:29:50,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:29:50,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:29:50,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:29:50,949 INFO L229 MonitoredProcess]: Starting monitored process 18 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:29:50,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 10:29:51,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 10:29:51,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:29:51,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-12 10:29:51,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:29:51,940 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:29:51,941 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 15 treesize of output 16 [2022-07-12 10:29:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:52,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:29:52,684 INFO L356 Elim1Store]: treesize reduction 29, result has 67.0 percent of original size [2022-07-12 10:29:52,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 71 [2022-07-12 10:29:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:29:53,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992689236] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:29:53,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:29:53,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 25] total 77 [2022-07-12 10:29:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827488758] [2022-07-12 10:29:53,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:29:53,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-07-12 10:29:53,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:29:53,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-07-12 10:29:53,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=5413, Unknown=0, NotChecked=0, Total=5852 [2022-07-12 10:29:53,513 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2022-07-12 10:29:53,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 652 transitions, 8111 flow. Second operand has 77 states, 77 states have (on average 43.64935064935065) internal successors, (3361), 77 states have internal predecessors, (3361), 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:29:53,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:29:53,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2022-07-12 10:29:53,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:00,274 INFO L129 PetriNetUnfolder]: 4566/8409 cut-off events. [2022-07-12 10:30:00,274 INFO L130 PetriNetUnfolder]: For 100705/100769 co-relation queries the response was YES. [2022-07-12 10:30:00,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54347 conditions, 8409 events. 4566/8409 cut-off events. For 100705/100769 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 65920 event pairs, 778 based on Foata normal form. 18/8384 useless extension candidates. Maximal degree in co-relation 54237. Up to 5146 conditions per place. [2022-07-12 10:30:00,442 INFO L132 encePairwiseOnDemand]: 81/117 looper letters, 685 selfloop transitions, 384 changer transitions 10/1114 dead transitions. [2022-07-12 10:30:00,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 1114 transitions, 15769 flow [2022-07-12 10:30:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-07-12 10:30:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-07-12 10:30:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 3453 transitions. [2022-07-12 10:30:00,446 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3935042735042735 [2022-07-12 10:30:00,446 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 3453 transitions. [2022-07-12 10:30:00,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 3453 transitions. [2022-07-12 10:30:00,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:00,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 3453 transitions. [2022-07-12 10:30:00,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 46.04) internal successors, (3453), 75 states have internal predecessors, (3453), 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:30:00,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 117.0) internal successors, (8892), 76 states have internal predecessors, (8892), 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:30:00,456 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 117.0) internal successors, (8892), 76 states have internal predecessors, (8892), 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:30:00,456 INFO L186 Difference]: Start difference. First operand has 470 places, 652 transitions, 8111 flow. Second operand 75 states and 3453 transitions. [2022-07-12 10:30:00,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 1114 transitions, 15769 flow [2022-07-12 10:30:00,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 1114 transitions, 14809 flow, removed 331 selfloop flow, removed 43 redundant places. [2022-07-12 10:30:00,989 INFO L242 Difference]: Finished difference. Result has 529 places, 854 transitions, 11722 flow [2022-07-12 10:30:00,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=7489, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=11722, PETRI_PLACES=529, PETRI_TRANSITIONS=854} [2022-07-12 10:30:00,990 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 425 predicate places. [2022-07-12 10:30:00,990 INFO L495 AbstractCegarLoop]: Abstraction has has 529 places, 854 transitions, 11722 flow [2022-07-12 10:30:00,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 43.64935064935065) internal successors, (3361), 77 states have internal predecessors, (3361), 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:30:00,991 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:00,991 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:01,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 10:30:01,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:01,209 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:01,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:01,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1005576847, now seen corresponding path program 16 times [2022-07-12 10:30:01,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:01,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733299566] [2022-07-12 10:30:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:02,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:02,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733299566] [2022-07-12 10:30:02,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733299566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:02,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96769985] [2022-07-12 10:30:02,005 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 10:30:02,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:02,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:02,007 INFO L229 MonitoredProcess]: Starting monitored process 19 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:30:02,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 10:30:02,111 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 10:30:02,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:30:02,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-12 10:30:02,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:30:02,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:02,888 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-12 10:30:02,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 55 [2022-07-12 10:30:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:30:02,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96769985] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:02,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:02,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 21, 14] total 51 [2022-07-12 10:30:02,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862627066] [2022-07-12 10:30:02,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:02,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-12 10:30:02,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:02,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-12 10:30:03,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2365, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 10:30:03,001 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 117 [2022-07-12 10:30:03,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 854 transitions, 11722 flow. Second operand has 51 states, 51 states have (on average 44.11764705882353) internal successors, (2250), 51 states have internal predecessors, (2250), 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:30:03,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:03,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 117 [2022-07-12 10:30:03,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:07,926 INFO L129 PetriNetUnfolder]: 4760/8727 cut-off events. [2022-07-12 10:30:07,926 INFO L130 PetriNetUnfolder]: For 132788/132875 co-relation queries the response was YES. [2022-07-12 10:30:08,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64077 conditions, 8727 events. 4760/8727 cut-off events. For 132788/132875 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 68126 event pairs, 1066 based on Foata normal form. 20/8702 useless extension candidates. Maximal degree in co-relation 63940. Up to 6344 conditions per place. [2022-07-12 10:30:08,132 INFO L132 encePairwiseOnDemand]: 86/117 looper letters, 744 selfloop transitions, 228 changer transitions 4/1011 dead transitions. [2022-07-12 10:30:08,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 1011 transitions, 15660 flow [2022-07-12 10:30:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-12 10:30:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2022-07-12 10:30:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 2450 transitions. [2022-07-12 10:30:08,135 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.39509756490888565 [2022-07-12 10:30:08,136 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 2450 transitions. [2022-07-12 10:30:08,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 2450 transitions. [2022-07-12 10:30:08,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:08,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 2450 transitions. [2022-07-12 10:30:08,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 46.22641509433962) internal successors, (2450), 53 states have internal predecessors, (2450), 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:30:08,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 117.0) internal successors, (6318), 54 states have internal predecessors, (6318), 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:30:08,143 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 117.0) internal successors, (6318), 54 states have internal predecessors, (6318), 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:30:08,143 INFO L186 Difference]: Start difference. First operand has 529 places, 854 transitions, 11722 flow. Second operand 53 states and 2450 transitions. [2022-07-12 10:30:08,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 1011 transitions, 15660 flow [2022-07-12 10:30:09,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 1011 transitions, 14939 flow, removed 292 selfloop flow, removed 38 redundant places. [2022-07-12 10:30:09,079 INFO L242 Difference]: Finished difference. Result has 542 places, 861 transitions, 11631 flow [2022-07-12 10:30:09,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=11011, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=854, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=11631, PETRI_PLACES=542, PETRI_TRANSITIONS=861} [2022-07-12 10:30:09,080 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 438 predicate places. [2022-07-12 10:30:09,080 INFO L495 AbstractCegarLoop]: Abstraction has has 542 places, 861 transitions, 11631 flow [2022-07-12 10:30:09,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 44.11764705882353) internal successors, (2250), 51 states have internal predecessors, (2250), 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:30:09,080 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:09,081 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:09,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 10:30:09,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:09,298 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash 191143539, now seen corresponding path program 17 times [2022-07-12 10:30:09,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:09,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914656303] [2022-07-12 10:30:09,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:09,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:10,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:10,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914656303] [2022-07-12 10:30:10,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914656303] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:10,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434870907] [2022-07-12 10:30:10,097 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 10:30:10,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:10,135 INFO L229 MonitoredProcess]: Starting monitored process 20 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:30:10,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 10:30:10,227 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-07-12 10:30:10,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:30:10,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-12 10:30:10,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:10,565 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 13 treesize of output 9 [2022-07-12 10:30:10,717 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:30:10,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:30:10,897 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 18 treesize of output 20 [2022-07-12 10:30:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:11,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:11,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-12 10:30:11,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) (* (- 1) (select .cse0 c_~A~0.offset)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-12 10:30:11,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)))) 0)) is different from false [2022-07-12 10:30:11,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array Int Int))) (= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base)) (.cse0 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (* (- 1) (select .cse1 c_~A~0.offset)) c_~counter~0 (* (- 1) (select .cse1 (+ c_~A~0.offset 4))) (select .cse1 (+ c_~A~0.offset .cse0 4)))) 0)) is different from false [2022-07-12 10:30:11,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base) c_~A~0.offset)) c_~counter~0) 0)) is different from false [2022-07-12 10:30:11,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_562))) (+ (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) c_~A~0.base) c_~A~0.offset)) c_~counter~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))) 0)) is different from false [2022-07-12 10:30:11,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_562))) (+ c_~counter~0 (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|))) 0)) is different from false [2022-07-12 10:30:11,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_562))) (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) 0)) is different from false [2022-07-12 10:30:11,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_562))) (+ (* (- 1) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~counter~0)) 0)) is different from false [2022-07-12 10:30:11,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:30:11,312 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 49 treesize of output 38 [2022-07-12 10:30:11,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 290 [2022-07-12 10:30:11,325 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 290 treesize of output 274 [2022-07-12 10:30:11,327 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 274 treesize of output 258 [2022-07-12 10:30:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 13 not checked. [2022-07-12 10:30:11,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434870907] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:11,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:11,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 23] total 64 [2022-07-12 10:30:11,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19613709] [2022-07-12 10:30:11,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:11,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-12 10:30:11,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:11,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-12 10:30:11,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2796, Unknown=9, NotChecked=1026, Total=4032 [2022-07-12 10:30:11,476 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 117 [2022-07-12 10:30:11,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 861 transitions, 11631 flow. Second operand has 64 states, 64 states have (on average 40.890625) internal successors, (2617), 64 states have internal predecessors, (2617), 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:30:11,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:11,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 117 [2022-07-12 10:30:11,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:18,046 INFO L129 PetriNetUnfolder]: 6320/11529 cut-off events. [2022-07-12 10:30:18,046 INFO L130 PetriNetUnfolder]: For 174299/174390 co-relation queries the response was YES. [2022-07-12 10:30:18,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86340 conditions, 11529 events. 6320/11529 cut-off events. For 174299/174390 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 93851 event pairs, 1166 based on Foata normal form. 20/11510 useless extension candidates. Maximal degree in co-relation 86205. Up to 7834 conditions per place. [2022-07-12 10:30:18,207 INFO L132 encePairwiseOnDemand]: 83/117 looper letters, 1014 selfloop transitions, 423 changer transitions 4/1473 dead transitions. [2022-07-12 10:30:18,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 1473 transitions, 24158 flow [2022-07-12 10:30:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-07-12 10:30:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-07-12 10:30:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 2669 transitions. [2022-07-12 10:30:18,210 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.37396665265517726 [2022-07-12 10:30:18,210 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 2669 transitions. [2022-07-12 10:30:18,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 2669 transitions. [2022-07-12 10:30:18,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:18,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 2669 transitions. [2022-07-12 10:30:18,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 43.75409836065574) internal successors, (2669), 61 states have internal predecessors, (2669), 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:30:18,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 117.0) internal successors, (7254), 62 states have internal predecessors, (7254), 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:30:18,218 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 117.0) internal successors, (7254), 62 states have internal predecessors, (7254), 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:30:18,218 INFO L186 Difference]: Start difference. First operand has 542 places, 861 transitions, 11631 flow. Second operand 61 states and 2669 transitions. [2022-07-12 10:30:18,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 1473 transitions, 24158 flow [2022-07-12 10:30:19,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 1473 transitions, 23559 flow, removed 38 selfloop flow, removed 49 redundant places. [2022-07-12 10:30:19,245 INFO L242 Difference]: Finished difference. Result has 579 places, 1215 transitions, 18982 flow [2022-07-12 10:30:19,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=11259, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=861, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=18982, PETRI_PLACES=579, PETRI_TRANSITIONS=1215} [2022-07-12 10:30:19,246 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 475 predicate places. [2022-07-12 10:30:19,247 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 1215 transitions, 18982 flow [2022-07-12 10:30:19,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 40.890625) internal successors, (2617), 64 states have internal predecessors, (2617), 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:30:19,247 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:19,247 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:19,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-12 10:30:19,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:19,464 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -771135465, now seen corresponding path program 18 times [2022-07-12 10:30:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:19,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052071858] [2022-07-12 10:30:19,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:19,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:20,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:20,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052071858] [2022-07-12 10:30:20,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052071858] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:20,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889497220] [2022-07-12 10:30:20,126 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 10:30:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:20,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:20,128 INFO L229 MonitoredProcess]: Starting monitored process 21 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:30:20,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 10:30:20,233 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-12 10:30:20,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:30:20,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-12 10:30:20,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:20,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:30:20,668 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 18 treesize of output 20 [2022-07-12 10:30:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:30:20,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:21,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_592) c_~A~0.base))) (+ (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)))) 0)) is different from false [2022-07-12 10:30:21,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_592) c_~A~0.base))) (+ (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)))) 0)) is different from false [2022-07-12 10:30:21,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_592) c_~A~0.base))) (+ (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) (* (- 1) (select .cse0 c_~A~0.offset)))) 0)) is different from false [2022-07-12 10:30:21,056 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-12 10:30:21,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2022-07-12 10:30:21,072 INFO L356 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-07-12 10:30:21,072 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 29 treesize of output 39 [2022-07-12 10:30:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-07-12 10:30:21,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889497220] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:21,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:21,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 21, 21] total 57 [2022-07-12 10:30:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138534274] [2022-07-12 10:30:21,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:21,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-12 10:30:21,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:21,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-12 10:30:21,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2691, Unknown=3, NotChecked=318, Total=3192 [2022-07-12 10:30:21,510 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 117 [2022-07-12 10:30:21,511 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 1215 transitions, 18982 flow. Second operand has 57 states, 57 states have (on average 42.05263157894737) internal successors, (2397), 57 states have internal predecessors, (2397), 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:30:21,512 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:21,512 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 117 [2022-07-12 10:30:21,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:28,418 INFO L129 PetriNetUnfolder]: 7049/12919 cut-off events. [2022-07-12 10:30:28,418 INFO L130 PetriNetUnfolder]: For 339589/339738 co-relation queries the response was YES. [2022-07-12 10:30:28,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115209 conditions, 12919 events. 7049/12919 cut-off events. For 339589/339738 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 108110 event pairs, 1607 based on Foata normal form. 41/12890 useless extension candidates. Maximal degree in co-relation 115049. Up to 9093 conditions per place. [2022-07-12 10:30:28,758 INFO L132 encePairwiseOnDemand]: 85/117 looper letters, 958 selfloop transitions, 485 changer transitions 4/1479 dead transitions. [2022-07-12 10:30:28,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 1479 transitions, 26102 flow [2022-07-12 10:30:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-12 10:30:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-07-12 10:30:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 2237 transitions. [2022-07-12 10:30:28,761 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3823931623931624 [2022-07-12 10:30:28,761 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 2237 transitions. [2022-07-12 10:30:28,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 2237 transitions. [2022-07-12 10:30:28,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:28,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 2237 transitions. [2022-07-12 10:30:28,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 44.74) internal successors, (2237), 50 states have internal predecessors, (2237), 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:30:28,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 117.0) internal successors, (5967), 51 states have internal predecessors, (5967), 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:30:28,767 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 117.0) internal successors, (5967), 51 states have internal predecessors, (5967), 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:30:28,767 INFO L186 Difference]: Start difference. First operand has 579 places, 1215 transitions, 18982 flow. Second operand 50 states and 2237 transitions. [2022-07-12 10:30:28,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 1479 transitions, 26102 flow [2022-07-12 10:30:30,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 1479 transitions, 25450 flow, removed 207 selfloop flow, removed 28 redundant places. [2022-07-12 10:30:30,594 INFO L242 Difference]: Finished difference. Result has 611 places, 1317 transitions, 21841 flow [2022-07-12 10:30:30,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=18424, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=392, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=760, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=21841, PETRI_PLACES=611, PETRI_TRANSITIONS=1317} [2022-07-12 10:30:30,595 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 507 predicate places. [2022-07-12 10:30:30,595 INFO L495 AbstractCegarLoop]: Abstraction has has 611 places, 1317 transitions, 21841 flow [2022-07-12 10:30:30,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 42.05263157894737) internal successors, (2397), 57 states have internal predecessors, (2397), 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:30:30,596 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:30,596 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:30,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-12 10:30:30,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-12 10:30:30,814 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:30,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:30,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2086619099, now seen corresponding path program 19 times [2022-07-12 10:30:30,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:30,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726082243] [2022-07-12 10:30:30,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:30,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726082243] [2022-07-12 10:30:31,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726082243] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:31,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629543415] [2022-07-12 10:30:31,412 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 10:30:31,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:31,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:31,414 INFO L229 MonitoredProcess]: Starting monitored process 22 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:30:31,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 10:30:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:31,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-12 10:30:31,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:31,519 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:30:31,591 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:30:31,592 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 11 treesize of output 11 [2022-07-12 10:30:31,936 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 18 treesize of output 20 [2022-07-12 10:30:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:30:32,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:32,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_622) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) 0)) is different from false [2022-07-12 10:30:32,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_622) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-12 10:30:32,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_622) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) c_~counter~0 (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-12 10:30:32,395 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-12 10:30:32,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2022-07-12 10:30:32,412 INFO L356 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-07-12 10:30:32,413 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 29 treesize of output 39 [2022-07-12 10:30:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-07-12 10:30:32,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629543415] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:32,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:32,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 21] total 57 [2022-07-12 10:30:32,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609684863] [2022-07-12 10:30:32,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:32,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-12 10:30:32,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:32,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-12 10:30:32,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2669, Unknown=3, NotChecked=318, Total=3192 [2022-07-12 10:30:32,707 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 117 [2022-07-12 10:30:32,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 1317 transitions, 21841 flow. Second operand has 57 states, 57 states have (on average 41.91228070175438) internal successors, (2389), 57 states have internal predecessors, (2389), 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:30:32,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:32,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 117 [2022-07-12 10:30:32,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:41,098 INFO L129 PetriNetUnfolder]: 8591/15839 cut-off events. [2022-07-12 10:30:41,098 INFO L130 PetriNetUnfolder]: For 467646/467791 co-relation queries the response was YES. [2022-07-12 10:30:41,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148210 conditions, 15839 events. 8591/15839 cut-off events. For 467646/467791 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 136120 event pairs, 1836 based on Foata normal form. 49/15817 useless extension candidates. Maximal degree in co-relation 148038. Up to 10046 conditions per place. [2022-07-12 10:30:41,519 INFO L132 encePairwiseOnDemand]: 84/117 looper letters, 1242 selfloop transitions, 820 changer transitions 8/2102 dead transitions. [2022-07-12 10:30:41,520 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 2102 transitions, 40509 flow [2022-07-12 10:30:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-07-12 10:30:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-07-12 10:30:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 3469 transitions. [2022-07-12 10:30:41,523 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.38012272627657245 [2022-07-12 10:30:41,523 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 3469 transitions. [2022-07-12 10:30:41,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 3469 transitions. [2022-07-12 10:30:41,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:41,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 3469 transitions. [2022-07-12 10:30:41,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 44.47435897435897) internal successors, (3469), 78 states have internal predecessors, (3469), 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:30:41,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 117.0) internal successors, (9243), 79 states have internal predecessors, (9243), 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:30:41,532 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 117.0) internal successors, (9243), 79 states have internal predecessors, (9243), 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:30:41,532 INFO L186 Difference]: Start difference. First operand has 611 places, 1317 transitions, 21841 flow. Second operand 78 states and 3469 transitions. [2022-07-12 10:30:41,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 2102 transitions, 40509 flow [2022-07-12 10:30:44,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 2102 transitions, 39748 flow, removed 268 selfloop flow, removed 33 redundant places. [2022-07-12 10:30:44,301 INFO L242 Difference]: Finished difference. Result has 691 places, 1803 transitions, 34108 flow [2022-07-12 10:30:44,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=21092, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=435, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=34108, PETRI_PLACES=691, PETRI_TRANSITIONS=1803} [2022-07-12 10:30:44,302 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 587 predicate places. [2022-07-12 10:30:44,302 INFO L495 AbstractCegarLoop]: Abstraction has has 691 places, 1803 transitions, 34108 flow [2022-07-12 10:30:44,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 41.91228070175438) internal successors, (2389), 57 states have internal predecessors, (2389), 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:30:44,303 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:30:44,303 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:44,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-12 10:30:44,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 10:30:44,508 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:30:44,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:30:44,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1982964057, now seen corresponding path program 20 times [2022-07-12 10:30:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:30:44,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474649059] [2022-07-12 10:30:44,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:30:44,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:30:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:30:45,118 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:30:45,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:30:45,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474649059] [2022-07-12 10:30:45,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474649059] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:30:45,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222430152] [2022-07-12 10:30:45,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:30:45,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:30:45,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:30:45,120 INFO L229 MonitoredProcess]: Starting monitored process 23 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:30:45,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-12 10:30:45,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:30:45,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:30:45,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-12 10:30:45,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:30:45,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 10:30:45,671 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 18 treesize of output 20 [2022-07-12 10:30:45,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 10:30:45,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:30:45,823 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 31 treesize of output 14 [2022-07-12 10:30:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 10:30:45,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:30:46,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-12 10:30:46,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) c_~A~0.base))) (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-12 10:30:46,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_651 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_651) c_~A~0.base))) (+ c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-12 10:30:46,048 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-12 10:30:46,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2022-07-12 10:30:46,093 INFO L356 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-07-12 10:30:46,093 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 29 treesize of output 39 [2022-07-12 10:30:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-07-12 10:30:46,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222430152] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:30:46,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:30:46,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 21, 21] total 57 [2022-07-12 10:30:46,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579966027] [2022-07-12 10:30:46,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:30:46,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-12 10:30:46,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:30:46,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-12 10:30:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2688, Unknown=3, NotChecked=318, Total=3192 [2022-07-12 10:30:46,456 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 117 [2022-07-12 10:30:46,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 1803 transitions, 34108 flow. Second operand has 57 states, 57 states have (on average 42.01754385964912) internal successors, (2395), 57 states have internal predecessors, (2395), 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:30:46,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:30:46,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 117 [2022-07-12 10:30:46,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:30:59,259 INFO L129 PetriNetUnfolder]: 9890/18288 cut-off events. [2022-07-12 10:30:59,259 INFO L130 PetriNetUnfolder]: For 1442790/1443011 co-relation queries the response was YES. [2022-07-12 10:30:59,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 219193 conditions, 18288 events. 9890/18288 cut-off events. For 1442790/1443011 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 161420 event pairs, 2111 based on Foata normal form. 124/18332 useless extension candidates. Maximal degree in co-relation 218984. Up to 10746 conditions per place. [2022-07-12 10:30:59,729 INFO L132 encePairwiseOnDemand]: 84/117 looper letters, 1205 selfloop transitions, 1261 changer transitions 4/2502 dead transitions. [2022-07-12 10:30:59,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 2502 transitions, 54277 flow [2022-07-12 10:30:59,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-07-12 10:30:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-07-12 10:30:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 3152 transitions. [2022-07-12 10:30:59,748 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.37943902732635126 [2022-07-12 10:30:59,748 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 3152 transitions. [2022-07-12 10:30:59,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 3152 transitions. [2022-07-12 10:30:59,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:30:59,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 3152 transitions. [2022-07-12 10:30:59,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 44.394366197183096) internal successors, (3152), 71 states have internal predecessors, (3152), 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:30:59,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 117.0) internal successors, (8424), 72 states have internal predecessors, (8424), 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:30:59,773 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 117.0) internal successors, (8424), 72 states have internal predecessors, (8424), 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:30:59,773 INFO L186 Difference]: Start difference. First operand has 691 places, 1803 transitions, 34108 flow. Second operand 71 states and 3152 transitions. [2022-07-12 10:30:59,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 2502 transitions, 54277 flow [2022-07-12 10:31:06,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 2502 transitions, 52715 flow, removed 645 selfloop flow, removed 38 redundant places. [2022-07-12 10:31:06,340 INFO L242 Difference]: Finished difference. Result has 738 places, 2196 transitions, 45047 flow [2022-07-12 10:31:06,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=32754, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=915, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=782, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=45047, PETRI_PLACES=738, PETRI_TRANSITIONS=2196} [2022-07-12 10:31:06,342 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 634 predicate places. [2022-07-12 10:31:06,342 INFO L495 AbstractCegarLoop]: Abstraction has has 738 places, 2196 transitions, 45047 flow [2022-07-12 10:31:06,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 42.01754385964912) internal successors, (2395), 57 states have internal predecessors, (2395), 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:31:06,343 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:31:06,343 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:06,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-07-12 10:31:06,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 10:31:06,560 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:31:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:31:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash 722800081, now seen corresponding path program 21 times [2022-07-12 10:31:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:31:06,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016668623] [2022-07-12 10:31:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:31:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:31:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:31:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:31:07,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:31:07,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016668623] [2022-07-12 10:31:07,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016668623] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:31:07,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492294617] [2022-07-12 10:31:07,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:31:07,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:31:07,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:31:07,256 INFO L229 MonitoredProcess]: Starting monitored process 24 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:31:07,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-12 10:31:07,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 10:31:07,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:31:07,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-12 10:31:07,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:31:07,375 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:31:07,557 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:31:07,557 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 11 treesize of output 11 [2022-07-12 10:31:07,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 10:31:08,042 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:31:08,291 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 18 treesize of output 20 [2022-07-12 10:31:08,524 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:31:08,525 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 19 treesize of output 20 [2022-07-12 10:31:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:31:08,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:31:09,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) 0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)))) is different from false [2022-07-12 10:31:09,062 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) 0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)))) (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0))) is different from false [2022-07-12 10:31:09,185 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0)) 0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)))) (not (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0))) is different from false [2022-07-12 10:31:09,194 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) c_~N~0)) (forall ((v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)) (= (let ((.cse0 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select .cse1 (+ c_~A~0.offset .cse0 4)) (* (- 1) (select .cse1 c_~A~0.offset)) (* (- 1) (select .cse1 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0)) 0)))) is different from false [2022-07-12 10:31:09,223 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0 (select .cse0 (+ c_~A~0.offset 4)))) 0) (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)))) (not (< 1 c_~N~0))) is different from false [2022-07-12 10:31:09,243 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_683))) (let ((.cse1 (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) c_~A~0.base))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (* (- 1) (select .cse1 (+ c_~A~0.offset (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) c_~counter~0 (select .cse1 (+ c_~A~0.offset 4)) (* (- 1) (select .cse1 c_~A~0.offset))))) 0))) (not (< 1 c_~N~0))) is different from false [2022-07-12 10:31:09,278 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_683))) (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_main_#t~ret8#1.base|))) (+ (* (- 1) (select .cse0 |c_ULTIMATE.start_main_#t~ret8#1.offset|)) (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret8#1.offset| 4)) (select (select .cse1 |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|) c_~counter~0 (* (- 1) (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret8#1.offset| (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|))))))) 0))) (not (< 1 c_~N~0))) is different from false [2022-07-12 10:31:09,296 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0)) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_683))) (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (+ (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) c_~counter~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (* (- 1) (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|)))) (* (- 1) (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) 0))) (not (< 1 c_~N~0))) is different from false [2022-07-12 10:31:09,307 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 1 c_~N~0)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_thread2Thread1of1ForFork1_~i~1#1_95| Int)) (or (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_683))) (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_684) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (* (- 1) (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~counter~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (* (- 1) (select .cse0 (+ (* 4 |v_thread2Thread1of1ForFork1_~i~1#1_95|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) 0) (< (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_95|) c_~N~0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_95| c_~N~0))))) is different from false [2022-07-12 10:31:09,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 10:31:09,608 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 103 treesize of output 68 [2022-07-12 10:31:09,623 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-07-12 10:31:09,623 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 278 treesize of output 244 [2022-07-12 10:31:09,633 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-07-12 10:31:09,633 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 234 treesize of output 196 [2022-07-12 10:31:09,643 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-07-12 10:31:09,644 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 186 treesize of output 168 [2022-07-12 10:31:10,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 10:31:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 10:31:10,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492294617] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:31:10,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:31:10,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 91 [2022-07-12 10:31:10,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535534499] [2022-07-12 10:31:10,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:31:10,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-07-12 10:31:10,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:31:10,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-07-12 10:31:10,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=6210, Unknown=15, NotChecked=1512, Total=8190 [2022-07-12 10:31:10,364 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 117 [2022-07-12 10:31:10,366 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 738 places, 2196 transitions, 45047 flow. Second operand has 91 states, 91 states have (on average 40.2967032967033) internal successors, (3667), 91 states have internal predecessors, (3667), 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:31:10,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:31:10,366 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 117 [2022-07-12 10:31:10,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:31:30,759 INFO L129 PetriNetUnfolder]: 12889/24051 cut-off events. [2022-07-12 10:31:30,759 INFO L130 PetriNetUnfolder]: For 1864963/1865271 co-relation queries the response was YES. [2022-07-12 10:31:31,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 285277 conditions, 24051 events. 12889/24051 cut-off events. For 1864963/1865271 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 223090 event pairs, 2059 based on Foata normal form. 84/24076 useless extension candidates. Maximal degree in co-relation 285052. Up to 11998 conditions per place. [2022-07-12 10:31:31,458 INFO L132 encePairwiseOnDemand]: 76/117 looper letters, 1495 selfloop transitions, 1814 changer transitions 8/3349 dead transitions. [2022-07-12 10:31:31,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 823 places, 3349 transitions, 73381 flow [2022-07-12 10:31:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-07-12 10:31:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2022-07-12 10:31:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 3902 transitions. [2022-07-12 10:31:31,462 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.37898212898212896 [2022-07-12 10:31:31,462 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 3902 transitions. [2022-07-12 10:31:31,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 3902 transitions. [2022-07-12 10:31:31,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:31:31,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 3902 transitions. [2022-07-12 10:31:31,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 44.34090909090909) internal successors, (3902), 88 states have internal predecessors, (3902), 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:31:31,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 117.0) internal successors, (10413), 89 states have internal predecessors, (10413), 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:31:31,487 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 117.0) internal successors, (10413), 89 states have internal predecessors, (10413), 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:31:31,487 INFO L186 Difference]: Start difference. First operand has 738 places, 2196 transitions, 45047 flow. Second operand 88 states and 3902 transitions. [2022-07-12 10:31:31,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 823 places, 3349 transitions, 73381 flow [2022-07-12 10:31:42,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 786 places, 3349 transitions, 72099 flow, removed 412 selfloop flow, removed 37 redundant places. [2022-07-12 10:31:42,263 INFO L242 Difference]: Finished difference. Result has 823 places, 2902 transitions, 64711 flow [2022-07-12 10:31:42,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=43941, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=64711, PETRI_PLACES=823, PETRI_TRANSITIONS=2902} [2022-07-12 10:31:42,265 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, 719 predicate places. [2022-07-12 10:31:42,266 INFO L495 AbstractCegarLoop]: Abstraction has has 823 places, 2902 transitions, 64711 flow [2022-07-12 10:31:42,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 40.2967032967033) internal successors, (3667), 91 states have internal predecessors, (3667), 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:31:42,266 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:31:42,267 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:42,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-12 10:31:42,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:31:42,484 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-12 10:31:42,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:31:42,484 INFO L85 PathProgramCache]: Analyzing trace with hash 223892959, now seen corresponding path program 22 times [2022-07-12 10:31:42,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:31:42,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549726099] [2022-07-12 10:31:42,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:31:42,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:31:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:31:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:31:43,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:31:43,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549726099] [2022-07-12 10:31:43,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549726099] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:31:43,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360077859] [2022-07-12 10:31:43,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 10:31:43,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:31:43,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:31:43,239 INFO L229 MonitoredProcess]: Starting monitored process 25 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:31:43,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-12 10:31:43,361 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 10:31:43,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:31:43,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-12 10:31:43,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:31:43,378 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:31:43,435 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:31:43,435 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 11 treesize of output 11 [2022-07-12 10:31:43,779 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 18 treesize of output 20 [2022-07-12 10:31:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 10:31:43,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:31:44,158 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_714 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_714) c_~A~0.base))) (+ c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) 0)) is different from false [2022-07-12 10:31:44,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_714 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_714) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_#t~post1#1| 4) 4)) c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))) 0)) is different from false [2022-07-12 10:31:44,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_714 (Array Int Int))) (= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_714) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4)) c_~counter~0 (* (- 1) (select .cse0 c_~A~0.offset)) (* (- 1) (select .cse0 (+ c_~A~0.offset 4))))))) is different from false [2022-07-12 10:31:44,213 INFO L356 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-07-12 10:31:44,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 89 [2022-07-12 10:31:44,229 INFO L356 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-07-12 10:31:44,229 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 29 treesize of output 39 [2022-07-12 10:31:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 3 not checked. [2022-07-12 10:31:44,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360077859] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:31:44,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:31:44,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 23, 21] total 63 [2022-07-12 10:31:44,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410981040] [2022-07-12 10:31:44,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:31:44,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-12 10:31:44,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:31:44,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-12 10:31:44,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3312, Unknown=3, NotChecked=354, Total=3906 [2022-07-12 10:31:44,612 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 117 [2022-07-12 10:31:44,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 823 places, 2902 transitions, 64711 flow. Second operand has 63 states, 63 states have (on average 40.857142857142854) internal successors, (2574), 63 states have internal predecessors, (2574), 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:31:44,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:31:44,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 117 [2022-07-12 10:31:44,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand