./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/parallel-misc-5.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 3f696f3d7a078e1a0d9bb5ce793945c7092990826a45e57529562474d0b18f4a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:08:11,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:08:11,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:08:11,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:08:11,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:08:11,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:08:11,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:08:11,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:08:11,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:08:11,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:08:11,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:08:11,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:08:11,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:08:11,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:08:11,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:08:11,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:08:11,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:08:11,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:08:11,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:08:11,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:08:11,855 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:08:11,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:08:11,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:08:11,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:08:11,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:08:11,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:08:11,862 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:08:11,862 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:08:11,863 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:08:11,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:08:11,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:08:11,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:08:11,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:08:11,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:08:11,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:08:11,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:08:11,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:08:11,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:08:11,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:08:11,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:08:11,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:08:11,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:08:11,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 22:08:11,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:08:11,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:08:11,894 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:08:11,895 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:08:11,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:08:11,896 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:08:11,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:08:11,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:08:11,897 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:08:11,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:08:11,898 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 22:08:11,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:08:11,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 22:08:11,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:08:11,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:08:11,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:08:11,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:08:11,899 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 22:08:11,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:08:11,899 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:08:11,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:08:11,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:08:11,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:08:11,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:08:11,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:08:11,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:08:11,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:08:11,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:08:11,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:08:11,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:08:11,902 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:08:11,902 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:08:11,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:08:11,902 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 -> 3f696f3d7a078e1a0d9bb5ce793945c7092990826a45e57529562474d0b18f4a [2022-07-13 22:08:12,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:08:12,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:08:12,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:08:12,147 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:08:12,151 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:08:12,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-07-13 22:08:12,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf25371c8/e4b73ff7fb934a91a4612c058921a9af/FLAG6125e722a [2022-07-13 22:08:12,592 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:08:12,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c [2022-07-13 22:08:12,599 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf25371c8/e4b73ff7fb934a91a4612c058921a9af/FLAG6125e722a [2022-07-13 22:08:13,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf25371c8/e4b73ff7fb934a91a4612c058921a9af [2022-07-13 22:08:13,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:08:13,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:08:13,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:08:13,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:08:13,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:08:13,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52511147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13, skipping insertion in model container [2022-07-13 22:08:13,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:08:13,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:08:13,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-5.wvr.c[3027,3040] [2022-07-13 22:08:13,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:08:13,208 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:08:13,232 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/parallel-misc-5.wvr.c[3027,3040] [2022-07-13 22:08:13,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:08:13,247 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:08:13,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13 WrapperNode [2022-07-13 22:08:13,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:08:13,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:08:13,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:08:13,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:08:13,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,288 INFO L137 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-07-13 22:08:13,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:08:13,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:08:13,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:08:13,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:08:13,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:08:13,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:08:13,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:08:13,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:08:13,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13" (1/1) ... [2022-07-13 22:08:13,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:08:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:08:13,353 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-13 22:08:13,361 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-13 22:08:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:08:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-13 22:08:13,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-13 22:08:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-13 22:08:13,404 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-13 22:08:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-13 22:08:13,404 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-13 22:08:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:08:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:08:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:08:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 22:08:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 22:08:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:08:13,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:08:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:08:13,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:08:13,412 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 22:08:13,582 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:08:13,591 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:08:14,029 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:08:14,165 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:08:14,171 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 22:08:14,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:08:14 BoogieIcfgContainer [2022-07-13 22:08:14,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:08:14,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:08:14,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:08:14,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:08:14,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:08:13" (1/3) ... [2022-07-13 22:08:14,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fea0cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:08:14, skipping insertion in model container [2022-07-13 22:08:14,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:08:13" (2/3) ... [2022-07-13 22:08:14,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fea0cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:08:14, skipping insertion in model container [2022-07-13 22:08:14,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:08:14" (3/3) ... [2022-07-13 22:08:14,195 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2022-07-13 22:08:14,200 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 22:08:14,217 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:08:14,231 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:08:14,231 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 22:08:14,318 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-13 22:08:14,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 109 transitions, 242 flow [2022-07-13 22:08:14,392 INFO L129 PetriNetUnfolder]: 7/106 cut-off events. [2022-07-13 22:08:14,393 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-13 22:08:14,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 7/106 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-07-13 22:08:14,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 109 transitions, 242 flow [2022-07-13 22:08:14,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 95 transitions, 208 flow [2022-07-13 22:08:14,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:08:14,417 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@511a9478, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2715f8ed [2022-07-13 22:08:14,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-13 22:08:14,465 INFO L129 PetriNetUnfolder]: 7/94 cut-off events. [2022-07-13 22:08:14,465 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-13 22:08:14,465 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:14,466 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] [2022-07-13 22:08:14,467 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash 722273223, now seen corresponding path program 1 times [2022-07-13 22:08:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:14,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045720885] [2022-07-13 22:08:14,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:14,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:14,713 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-13 22:08:14,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:14,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045720885] [2022-07-13 22:08:14,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045720885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:14,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:14,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:08:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296020121] [2022-07-13 22:08:14,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:14,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:08:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:08:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:08:14,761 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 109 [2022-07-13 22:08:14,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 208 flow. Second operand has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:14,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:14,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 109 [2022-07-13 22:08:14,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:14,871 INFO L129 PetriNetUnfolder]: 36/184 cut-off events. [2022-07-13 22:08:14,873 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-07-13 22:08:14,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 184 events. 36/184 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 463 event pairs, 7 based on Foata normal form. 18/184 useless extension candidates. Maximal degree in co-relation 178. Up to 49 conditions per place. [2022-07-13 22:08:14,880 INFO L132 encePairwiseOnDemand]: 106/109 looper letters, 10 selfloop transitions, 0 changer transitions 1/92 dead transitions. [2022-07-13 22:08:14,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 222 flow [2022-07-13 22:08:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:08:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-13 22:08:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2022-07-13 22:08:14,890 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9311926605504587 [2022-07-13 22:08:14,891 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 203 transitions. [2022-07-13 22:08:14,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 203 transitions. [2022-07-13 22:08:14,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:14,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 203 transitions. [2022-07-13 22:08:14,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:14,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:14,910 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:14,912 INFO L186 Difference]: Start difference. First operand has 98 places, 95 transitions, 208 flow. Second operand 2 states and 203 transitions. [2022-07-13 22:08:14,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 222 flow [2022-07-13 22:08:14,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 210 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-13 22:08:14,917 INFO L242 Difference]: Finished difference. Result has 93 places, 91 transitions, 188 flow [2022-07-13 22:08:14,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=188, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2022-07-13 22:08:14,922 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -5 predicate places. [2022-07-13 22:08:14,923 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 188 flow [2022-07-13 22:08:14,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:14,924 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:14,924 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] [2022-07-13 22:08:14,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:08:14,927 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:14,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1307011461, now seen corresponding path program 1 times [2022-07-13 22:08:14,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:14,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381389724] [2022-07-13 22:08:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:15,226 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-13 22:08:15,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:15,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381389724] [2022-07-13 22:08:15,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381389724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:15,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:15,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:08:15,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732458410] [2022-07-13 22:08:15,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:15,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:08:15,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:15,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:08:15,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:08:15,232 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-07-13 22:08:15,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:15,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:15,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-07-13 22:08:15,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:15,398 INFO L129 PetriNetUnfolder]: 95/279 cut-off events. [2022-07-13 22:08:15,398 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-13 22:08:15,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 279 events. 95/279 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 967 event pairs, 2 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 445. Up to 71 conditions per place. [2022-07-13 22:08:15,401 INFO L132 encePairwiseOnDemand]: 103/109 looper letters, 33 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2022-07-13 22:08:15,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 107 transitions, 300 flow [2022-07-13 22:08:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:08:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-07-13 22:08:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2022-07-13 22:08:15,405 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8042813455657493 [2022-07-13 22:08:15,405 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 526 transitions. [2022-07-13 22:08:15,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 526 transitions. [2022-07-13 22:08:15,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:15,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 526 transitions. [2022-07-13 22:08:15,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:15,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:15,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:15,411 INFO L186 Difference]: Start difference. First operand has 93 places, 91 transitions, 188 flow. Second operand 6 states and 526 transitions. [2022-07-13 22:08:15,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 107 transitions, 300 flow [2022-07-13 22:08:15,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 107 transitions, 300 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 22:08:15,414 INFO L242 Difference]: Finished difference. Result has 99 places, 93 transitions, 213 flow [2022-07-13 22:08:15,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2022-07-13 22:08:15,415 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2022-07-13 22:08:15,415 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 213 flow [2022-07-13 22:08:15,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:15,416 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:15,416 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:08:15,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:08:15,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:15,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1981283141, now seen corresponding path program 2 times [2022-07-13 22:08:15,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:15,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164208984] [2022-07-13 22:08:15,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:15,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:15,613 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-13 22:08:15,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:15,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164208984] [2022-07-13 22:08:15,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164208984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:15,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:15,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:08:15,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066303176] [2022-07-13 22:08:15,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:15,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:08:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:15,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:08:15,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:08:15,620 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 109 [2022-07-13 22:08:15,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:15,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:15,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 109 [2022-07-13 22:08:15,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:15,764 INFO L129 PetriNetUnfolder]: 99/326 cut-off events. [2022-07-13 22:08:15,764 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-07-13 22:08:15,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 326 events. 99/326 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1305 event pairs, 20 based on Foata normal form. 3/297 useless extension candidates. Maximal degree in co-relation 546. Up to 71 conditions per place. [2022-07-13 22:08:15,767 INFO L132 encePairwiseOnDemand]: 101/109 looper letters, 36 selfloop transitions, 8 changer transitions 0/112 dead transitions. [2022-07-13 22:08:15,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 112 transitions, 341 flow [2022-07-13 22:08:15,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:08:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 22:08:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2022-07-13 22:08:15,769 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8020969855832241 [2022-07-13 22:08:15,770 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2022-07-13 22:08:15,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2022-07-13 22:08:15,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:15,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2022-07-13 22:08:15,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:15,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:15,774 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:15,775 INFO L186 Difference]: Start difference. First operand has 99 places, 93 transitions, 213 flow. Second operand 7 states and 612 transitions. [2022-07-13 22:08:15,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 112 transitions, 341 flow [2022-07-13 22:08:15,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 112 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-13 22:08:15,778 INFO L242 Difference]: Finished difference. Result has 104 places, 95 transitions, 239 flow [2022-07-13 22:08:15,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=104, PETRI_TRANSITIONS=95} [2022-07-13 22:08:15,779 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2022-07-13 22:08:15,779 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 239 flow [2022-07-13 22:08:15,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:15,780 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:15,780 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] [2022-07-13 22:08:15,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:08:15,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:15,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:15,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1355540335, now seen corresponding path program 3 times [2022-07-13 22:08:15,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:15,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335207033] [2022-07-13 22:08:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:15,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:15,891 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-13 22:08:15,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:15,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335207033] [2022-07-13 22:08:15,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335207033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:15,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:15,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:08:15,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804158451] [2022-07-13 22:08:15,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:15,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:08:15,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:15,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:08:15,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:08:15,894 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-07-13 22:08:15,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 95 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:15,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:15,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-07-13 22:08:15,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:16,102 INFO L129 PetriNetUnfolder]: 224/608 cut-off events. [2022-07-13 22:08:16,103 INFO L130 PetriNetUnfolder]: For 242/242 co-relation queries the response was YES. [2022-07-13 22:08:16,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 608 events. 224/608 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3197 event pairs, 29 based on Foata normal form. 6/557 useless extension candidates. Maximal degree in co-relation 1166. Up to 157 conditions per place. [2022-07-13 22:08:16,108 INFO L132 encePairwiseOnDemand]: 98/109 looper letters, 33 selfloop transitions, 7 changer transitions 36/142 dead transitions. [2022-07-13 22:08:16,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 142 transitions, 539 flow [2022-07-13 22:08:16,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:08:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 22:08:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 784 transitions. [2022-07-13 22:08:16,110 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.799184505606524 [2022-07-13 22:08:16,111 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 784 transitions. [2022-07-13 22:08:16,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 784 transitions. [2022-07-13 22:08:16,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:16,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 784 transitions. [2022-07-13 22:08:16,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.11111111111111) internal successors, (784), 9 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,116 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,116 INFO L186 Difference]: Start difference. First operand has 104 places, 95 transitions, 239 flow. Second operand 9 states and 784 transitions. [2022-07-13 22:08:16,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 142 transitions, 539 flow [2022-07-13 22:08:16,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 142 transitions, 526 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-13 22:08:16,121 INFO L242 Difference]: Finished difference. Result has 113 places, 97 transitions, 281 flow [2022-07-13 22:08:16,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=281, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2022-07-13 22:08:16,122 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2022-07-13 22:08:16,122 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 281 flow [2022-07-13 22:08:16,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.57142857142857) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,123 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:16,123 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-13 22:08:16,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:08:16,123 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:16,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:16,124 INFO L85 PathProgramCache]: Analyzing trace with hash -214740210, now seen corresponding path program 1 times [2022-07-13 22:08:16,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:16,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077263945] [2022-07-13 22:08:16,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:16,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:16,239 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-13 22:08:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:16,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077263945] [2022-07-13 22:08:16,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077263945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:16,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:16,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:08:16,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176570721] [2022-07-13 22:08:16,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:16,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:08:16,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:16,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:08:16,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:08:16,243 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-13 22:08:16,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:16,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-13 22:08:16,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:16,464 INFO L129 PetriNetUnfolder]: 323/803 cut-off events. [2022-07-13 22:08:16,464 INFO L130 PetriNetUnfolder]: For 645/652 co-relation queries the response was YES. [2022-07-13 22:08:16,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 803 events. 323/803 cut-off events. For 645/652 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4554 event pairs, 25 based on Foata normal form. 6/724 useless extension candidates. Maximal degree in co-relation 1858. Up to 179 conditions per place. [2022-07-13 22:08:16,472 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 55 selfloop transitions, 18 changer transitions 6/148 dead transitions. [2022-07-13 22:08:16,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 148 transitions, 678 flow [2022-07-13 22:08:16,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:08:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 22:08:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2022-07-13 22:08:16,474 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.854521625163827 [2022-07-13 22:08:16,474 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2022-07-13 22:08:16,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2022-07-13 22:08:16,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:16,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2022-07-13 22:08:16,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,478 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,478 INFO L186 Difference]: Start difference. First operand has 113 places, 97 transitions, 281 flow. Second operand 7 states and 652 transitions. [2022-07-13 22:08:16,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 148 transitions, 678 flow [2022-07-13 22:08:16,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 148 transitions, 650 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-07-13 22:08:16,487 INFO L242 Difference]: Finished difference. Result has 116 places, 110 transitions, 420 flow [2022-07-13 22:08:16,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=420, PETRI_PLACES=116, PETRI_TRANSITIONS=110} [2022-07-13 22:08:16,490 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 18 predicate places. [2022-07-13 22:08:16,490 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 110 transitions, 420 flow [2022-07-13 22:08:16,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,491 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:16,491 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-13 22:08:16,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:08:16,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:16,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash -108227670, now seen corresponding path program 2 times [2022-07-13 22:08:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:16,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005560473] [2022-07-13 22:08:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:16,611 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-13 22:08:16,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:16,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005560473] [2022-07-13 22:08:16,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005560473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:16,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:16,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:08:16,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962618383] [2022-07-13 22:08:16,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:16,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:08:16,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:16,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:08:16,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:08:16,615 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-07-13 22:08:16,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 110 transitions, 420 flow. Second operand has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:16,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-07-13 22:08:16,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:16,927 INFO L129 PetriNetUnfolder]: 433/1135 cut-off events. [2022-07-13 22:08:16,927 INFO L130 PetriNetUnfolder]: For 2069/2085 co-relation queries the response was YES. [2022-07-13 22:08:16,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3197 conditions, 1135 events. 433/1135 cut-off events. For 2069/2085 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7301 event pairs, 67 based on Foata normal form. 16/1053 useless extension candidates. Maximal degree in co-relation 3181. Up to 236 conditions per place. [2022-07-13 22:08:16,938 INFO L132 encePairwiseOnDemand]: 97/109 looper letters, 68 selfloop transitions, 10 changer transitions 38/182 dead transitions. [2022-07-13 22:08:16,938 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 1095 flow [2022-07-13 22:08:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:08:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-13 22:08:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 931 transitions. [2022-07-13 22:08:16,941 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7764804003336113 [2022-07-13 22:08:16,941 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 931 transitions. [2022-07-13 22:08:16,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 931 transitions. [2022-07-13 22:08:16,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:16,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 931 transitions. [2022-07-13 22:08:16,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 84.63636363636364) internal successors, (931), 11 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,946 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,946 INFO L186 Difference]: Start difference. First operand has 116 places, 110 transitions, 420 flow. Second operand 11 states and 931 transitions. [2022-07-13 22:08:16,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 1095 flow [2022-07-13 22:08:16,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 182 transitions, 1084 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 22:08:16,986 INFO L242 Difference]: Finished difference. Result has 130 places, 112 transitions, 486 flow [2022-07-13 22:08:16,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=486, PETRI_PLACES=130, PETRI_TRANSITIONS=112} [2022-07-13 22:08:16,987 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 32 predicate places. [2022-07-13 22:08:16,987 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 112 transitions, 486 flow [2022-07-13 22:08:16,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:16,988 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:16,988 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-13 22:08:16,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 22:08:16,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:16,989 INFO L85 PathProgramCache]: Analyzing trace with hash 477981010, now seen corresponding path program 3 times [2022-07-13 22:08:16,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:16,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051775892] [2022-07-13 22:08:16,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:17,092 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-13 22:08:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:17,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051775892] [2022-07-13 22:08:17,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051775892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:17,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:17,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:08:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269208261] [2022-07-13 22:08:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:17,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:08:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:17,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:08:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:08:17,095 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-13 22:08:17,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 112 transitions, 486 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:17,096 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:17,096 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-13 22:08:17,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:17,389 INFO L129 PetriNetUnfolder]: 594/1490 cut-off events. [2022-07-13 22:08:17,389 INFO L130 PetriNetUnfolder]: For 4347/4374 co-relation queries the response was YES. [2022-07-13 22:08:17,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4675 conditions, 1490 events. 594/1490 cut-off events. For 4347/4374 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10737 event pairs, 42 based on Foata normal form. 12/1388 useless extension candidates. Maximal degree in co-relation 4654. Up to 334 conditions per place. [2022-07-13 22:08:17,406 INFO L132 encePairwiseOnDemand]: 101/109 looper letters, 74 selfloop transitions, 30 changer transitions 2/175 dead transitions. [2022-07-13 22:08:17,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 175 transitions, 1212 flow [2022-07-13 22:08:17,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:08:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 22:08:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions. [2022-07-13 22:08:17,409 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8558322411533421 [2022-07-13 22:08:17,409 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 653 transitions. [2022-07-13 22:08:17,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions. [2022-07-13 22:08:17,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:17,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions. [2022-07-13 22:08:17,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:17,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:17,413 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:17,413 INFO L186 Difference]: Start difference. First operand has 130 places, 112 transitions, 486 flow. Second operand 7 states and 653 transitions. [2022-07-13 22:08:17,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 175 transitions, 1212 flow [2022-07-13 22:08:17,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 175 transitions, 1149 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-07-13 22:08:17,433 INFO L242 Difference]: Finished difference. Result has 130 places, 130 transitions, 785 flow [2022-07-13 22:08:17,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=785, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2022-07-13 22:08:17,434 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 32 predicate places. [2022-07-13 22:08:17,434 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 785 flow [2022-07-13 22:08:17,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:17,434 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:17,434 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-13 22:08:17,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 22:08:17,435 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:17,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:17,436 INFO L85 PathProgramCache]: Analyzing trace with hash 768641710, now seen corresponding path program 4 times [2022-07-13 22:08:17,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:17,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076821784] [2022-07-13 22:08:17,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:17,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:17,510 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-13 22:08:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:17,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076821784] [2022-07-13 22:08:17,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076821784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:17,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:17,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:08:17,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314478087] [2022-07-13 22:08:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:17,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:08:17,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:17,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:08:17,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:08:17,513 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-13 22:08:17,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 785 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:17,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:17,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-13 22:08:17,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:17,919 INFO L129 PetriNetUnfolder]: 832/2072 cut-off events. [2022-07-13 22:08:17,919 INFO L130 PetriNetUnfolder]: For 8233/8267 co-relation queries the response was YES. [2022-07-13 22:08:17,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6890 conditions, 2072 events. 832/2072 cut-off events. For 8233/8267 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16208 event pairs, 118 based on Foata normal form. 96/2036 useless extension candidates. Maximal degree in co-relation 6867. Up to 578 conditions per place. [2022-07-13 22:08:17,938 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 98 selfloop transitions, 49 changer transitions 22/238 dead transitions. [2022-07-13 22:08:17,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 238 transitions, 2090 flow [2022-07-13 22:08:17,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:08:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 22:08:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 841 transitions. [2022-07-13 22:08:17,941 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8572884811416922 [2022-07-13 22:08:17,942 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 841 transitions. [2022-07-13 22:08:17,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 841 transitions. [2022-07-13 22:08:17,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:17,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 841 transitions. [2022-07-13 22:08:17,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.44444444444444) internal successors, (841), 9 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:17,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:17,946 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:17,947 INFO L186 Difference]: Start difference. First operand has 130 places, 130 transitions, 785 flow. Second operand 9 states and 841 transitions. [2022-07-13 22:08:17,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 238 transitions, 2090 flow [2022-07-13 22:08:17,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 238 transitions, 2080 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-07-13 22:08:17,969 INFO L242 Difference]: Finished difference. Result has 146 places, 157 transitions, 1337 flow [2022-07-13 22:08:17,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1337, PETRI_PLACES=146, PETRI_TRANSITIONS=157} [2022-07-13 22:08:17,970 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 48 predicate places. [2022-07-13 22:08:17,970 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 157 transitions, 1337 flow [2022-07-13 22:08:17,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:17,970 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:17,971 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-13 22:08:17,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:08:17,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash 683985028, now seen corresponding path program 5 times [2022-07-13 22:08:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:17,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984799540] [2022-07-13 22:08:17,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:18,044 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-13 22:08:18,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:18,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984799540] [2022-07-13 22:08:18,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984799540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:18,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:18,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:08:18,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405375878] [2022-07-13 22:08:18,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:18,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:08:18,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:18,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:08:18,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:08:18,048 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-13 22:08:18,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 157 transitions, 1337 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:18,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:18,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-13 22:08:18,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:18,513 INFO L129 PetriNetUnfolder]: 871/2130 cut-off events. [2022-07-13 22:08:18,513 INFO L130 PetriNetUnfolder]: For 11966/12013 co-relation queries the response was YES. [2022-07-13 22:08:18,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8342 conditions, 2130 events. 871/2130 cut-off events. For 11966/12013 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16671 event pairs, 54 based on Foata normal form. 14/1983 useless extension candidates. Maximal degree in co-relation 8311. Up to 621 conditions per place. [2022-07-13 22:08:18,538 INFO L132 encePairwiseOnDemand]: 100/109 looper letters, 88 selfloop transitions, 64 changer transitions 3/224 dead transitions. [2022-07-13 22:08:18,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 224 transitions, 2274 flow [2022-07-13 22:08:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:08:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 22:08:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 833 transitions. [2022-07-13 22:08:18,542 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8491335372069317 [2022-07-13 22:08:18,542 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 833 transitions. [2022-07-13 22:08:18,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 833 transitions. [2022-07-13 22:08:18,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:18,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 833 transitions. [2022-07-13 22:08:18,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.55555555555556) internal successors, (833), 9 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:18,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:18,547 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 109.0) internal successors, (1090), 10 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:18,547 INFO L186 Difference]: Start difference. First operand has 146 places, 157 transitions, 1337 flow. Second operand 9 states and 833 transitions. [2022-07-13 22:08:18,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 224 transitions, 2274 flow [2022-07-13 22:08:18,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 224 transitions, 2226 flow, removed 24 selfloop flow, removed 1 redundant places. [2022-07-13 22:08:18,595 INFO L242 Difference]: Finished difference. Result has 157 places, 171 transitions, 1734 flow [2022-07-13 22:08:18,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1734, PETRI_PLACES=157, PETRI_TRANSITIONS=171} [2022-07-13 22:08:18,596 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 59 predicate places. [2022-07-13 22:08:18,597 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 171 transitions, 1734 flow [2022-07-13 22:08:18,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:18,597 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:18,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] [2022-07-13 22:08:18,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 22:08:18,598 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:18,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1839617844, now seen corresponding path program 6 times [2022-07-13 22:08:18,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:18,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750006167] [2022-07-13 22:08:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:18,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:18,705 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-13 22:08:18,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:18,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750006167] [2022-07-13 22:08:18,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750006167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:18,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:18,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:08:18,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667302406] [2022-07-13 22:08:18,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:18,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:08:18,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:18,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:08:18,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:08:18,713 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-13 22:08:18,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 171 transitions, 1734 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:18,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:18,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-13 22:08:18,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:19,108 INFO L129 PetriNetUnfolder]: 853/2078 cut-off events. [2022-07-13 22:08:19,108 INFO L130 PetriNetUnfolder]: For 15407/15432 co-relation queries the response was YES. [2022-07-13 22:08:19,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9036 conditions, 2078 events. 853/2078 cut-off events. For 15407/15432 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16188 event pairs, 220 based on Foata normal form. 7/1915 useless extension candidates. Maximal degree in co-relation 9000. Up to 1010 conditions per place. [2022-07-13 22:08:19,166 INFO L132 encePairwiseOnDemand]: 99/109 looper letters, 97 selfloop transitions, 38 changer transitions 10/214 dead transitions. [2022-07-13 22:08:19,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 214 transitions, 2540 flow [2022-07-13 22:08:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:08:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-13 22:08:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 723 transitions. [2022-07-13 22:08:19,170 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8291284403669725 [2022-07-13 22:08:19,170 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 723 transitions. [2022-07-13 22:08:19,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 723 transitions. [2022-07-13 22:08:19,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:19,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 723 transitions. [2022-07-13 22:08:19,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:19,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:19,174 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 109.0) internal successors, (981), 9 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:19,175 INFO L186 Difference]: Start difference. First operand has 157 places, 171 transitions, 1734 flow. Second operand 8 states and 723 transitions. [2022-07-13 22:08:19,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 214 transitions, 2540 flow [2022-07-13 22:08:19,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 214 transitions, 2381 flow, removed 40 selfloop flow, removed 4 redundant places. [2022-07-13 22:08:19,235 INFO L242 Difference]: Finished difference. Result has 162 places, 176 transitions, 1811 flow [2022-07-13 22:08:19,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1811, PETRI_PLACES=162, PETRI_TRANSITIONS=176} [2022-07-13 22:08:19,236 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 64 predicate places. [2022-07-13 22:08:19,237 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 176 transitions, 1811 flow [2022-07-13 22:08:19,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:19,237 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:19,238 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-13 22:08:19,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:08:19,238 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:19,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash -646087402, now seen corresponding path program 7 times [2022-07-13 22:08:19,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:19,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857585158] [2022-07-13 22:08:19,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:19,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:19,324 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-13 22:08:19,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:19,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857585158] [2022-07-13 22:08:19,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857585158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:19,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:19,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:08:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461958372] [2022-07-13 22:08:19,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:19,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:08:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:19,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:08:19,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:08:19,328 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 109 [2022-07-13 22:08:19,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 176 transitions, 1811 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:19,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:19,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 109 [2022-07-13 22:08:19,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:19,688 INFO L129 PetriNetUnfolder]: 832/1897 cut-off events. [2022-07-13 22:08:19,688 INFO L130 PetriNetUnfolder]: For 14689/14733 co-relation queries the response was YES. [2022-07-13 22:08:19,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 1897 events. 832/1897 cut-off events. For 14689/14733 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13901 event pairs, 48 based on Foata normal form. 2/1751 useless extension candidates. Maximal degree in co-relation 8487. Up to 615 conditions per place. [2022-07-13 22:08:19,718 INFO L132 encePairwiseOnDemand]: 101/109 looper letters, 110 selfloop transitions, 45 changer transitions 6/230 dead transitions. [2022-07-13 22:08:19,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 230 transitions, 2690 flow [2022-07-13 22:08:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:08:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 22:08:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2022-07-13 22:08:19,721 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8479685452162516 [2022-07-13 22:08:19,721 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 647 transitions. [2022-07-13 22:08:19,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 647 transitions. [2022-07-13 22:08:19,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:19,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 647 transitions. [2022-07-13 22:08:19,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:19,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:19,726 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:19,726 INFO L186 Difference]: Start difference. First operand has 162 places, 176 transitions, 1811 flow. Second operand 7 states and 647 transitions. [2022-07-13 22:08:19,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 230 transitions, 2690 flow [2022-07-13 22:08:19,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 230 transitions, 2583 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-07-13 22:08:19,796 INFO L242 Difference]: Finished difference. Result has 165 places, 176 transitions, 1851 flow [2022-07-13 22:08:19,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1851, PETRI_PLACES=165, PETRI_TRANSITIONS=176} [2022-07-13 22:08:19,798 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 67 predicate places. [2022-07-13 22:08:19,798 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 176 transitions, 1851 flow [2022-07-13 22:08:19,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:19,798 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:19,799 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-13 22:08:19,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 22:08:19,799 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:19,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:19,800 INFO L85 PathProgramCache]: Analyzing trace with hash 881879063, now seen corresponding path program 1 times [2022-07-13 22:08:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:19,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212669633] [2022-07-13 22:08:19,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:19,866 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-13 22:08:19,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:19,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212669633] [2022-07-13 22:08:19,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212669633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:19,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:19,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:08:19,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380472420] [2022-07-13 22:08:19,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:19,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:08:19,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:19,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:08:19,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:08:19,868 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-13 22:08:19,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 176 transitions, 1851 flow. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:19,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:19,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-13 22:08:19,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:20,149 INFO L129 PetriNetUnfolder]: 608/1824 cut-off events. [2022-07-13 22:08:20,150 INFO L130 PetriNetUnfolder]: For 11600/11693 co-relation queries the response was YES. [2022-07-13 22:08:20,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7026 conditions, 1824 events. 608/1824 cut-off events. For 11600/11693 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13717 event pairs, 53 based on Foata normal form. 34/1656 useless extension candidates. Maximal degree in co-relation 6987. Up to 381 conditions per place. [2022-07-13 22:08:20,181 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 18 selfloop transitions, 6 changer transitions 0/181 dead transitions. [2022-07-13 22:08:20,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 181 transitions, 1920 flow [2022-07-13 22:08:20,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:08:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-13 22:08:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-07-13 22:08:20,183 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8458715596330275 [2022-07-13 22:08:20,183 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 461 transitions. [2022-07-13 22:08:20,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 461 transitions. [2022-07-13 22:08:20,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:20,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 461 transitions. [2022-07-13 22:08:20,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:20,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:20,187 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:20,187 INFO L186 Difference]: Start difference. First operand has 165 places, 176 transitions, 1851 flow. Second operand 5 states and 461 transitions. [2022-07-13 22:08:20,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 181 transitions, 1920 flow [2022-07-13 22:08:20,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 181 transitions, 1845 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-07-13 22:08:20,244 INFO L242 Difference]: Finished difference. Result has 165 places, 177 transitions, 1800 flow [2022-07-13 22:08:20,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1776, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1800, PETRI_PLACES=165, PETRI_TRANSITIONS=177} [2022-07-13 22:08:20,246 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 67 predicate places. [2022-07-13 22:08:20,246 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 177 transitions, 1800 flow [2022-07-13 22:08:20,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:20,247 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:20,248 INFO L200 CegarLoopForPetriNet]: trace histogram [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] [2022-07-13 22:08:20,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 22:08:20,248 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:20,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:20,249 INFO L85 PathProgramCache]: Analyzing trace with hash -222094646, now seen corresponding path program 1 times [2022-07-13 22:08:20,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:20,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876994412] [2022-07-13 22:08:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:20,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:08:20,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:20,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876994412] [2022-07-13 22:08:20,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876994412] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:08:20,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669344884] [2022-07-13 22:08:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:20,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:08:20,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:08:20,344 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-13 22:08:20,366 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-13 22:08:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:20,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 22:08:20,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:08:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:08:20,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:08:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:08:20,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669344884] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:08:20,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:08:20,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2022-07-13 22:08:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355962617] [2022-07-13 22:08:20,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:08:20,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:08:20,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:20,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:08:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:08:20,710 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-07-13 22:08:20,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 177 transitions, 1800 flow. Second operand has 14 states, 14 states have (on average 81.78571428571429) internal successors, (1145), 14 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:20,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:20,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-07-13 22:08:20,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:21,873 INFO L129 PetriNetUnfolder]: 2093/5285 cut-off events. [2022-07-13 22:08:21,874 INFO L130 PetriNetUnfolder]: For 36424/36566 co-relation queries the response was YES. [2022-07-13 22:08:21,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21883 conditions, 5285 events. 2093/5285 cut-off events. For 36424/36566 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 48805 event pairs, 76 based on Foata normal form. 30/4845 useless extension candidates. Maximal degree in co-relation 21845. Up to 767 conditions per place. [2022-07-13 22:08:21,940 INFO L132 encePairwiseOnDemand]: 96/109 looper letters, 101 selfloop transitions, 118 changer transitions 166/465 dead transitions. [2022-07-13 22:08:21,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 465 transitions, 6491 flow [2022-07-13 22:08:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 22:08:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-13 22:08:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1809 transitions. [2022-07-13 22:08:21,945 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7903014416775884 [2022-07-13 22:08:21,945 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1809 transitions. [2022-07-13 22:08:21,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1809 transitions. [2022-07-13 22:08:21,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:21,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1809 transitions. [2022-07-13 22:08:21,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 86.14285714285714) internal successors, (1809), 21 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:21,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 109.0) internal successors, (2398), 22 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:21,955 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 109.0) internal successors, (2398), 22 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:21,955 INFO L186 Difference]: Start difference. First operand has 165 places, 177 transitions, 1800 flow. Second operand 21 states and 1809 transitions. [2022-07-13 22:08:21,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 465 transitions, 6491 flow [2022-07-13 22:08:22,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 465 transitions, 6480 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-13 22:08:22,171 INFO L242 Difference]: Finished difference. Result has 193 places, 258 transitions, 3415 flow [2022-07-13 22:08:22,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3415, PETRI_PLACES=193, PETRI_TRANSITIONS=258} [2022-07-13 22:08:22,173 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 95 predicate places. [2022-07-13 22:08:22,173 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 258 transitions, 3415 flow [2022-07-13 22:08:22,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.78571428571429) internal successors, (1145), 14 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:22,173 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:22,174 INFO L200 CegarLoopForPetriNet]: trace histogram [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] [2022-07-13 22:08:22,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 22:08:22,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 22:08:22,398 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:22,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 722917089, now seen corresponding path program 1 times [2022-07-13 22:08:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:22,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900806803] [2022-07-13 22:08:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:22,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 22:08:22,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:22,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900806803] [2022-07-13 22:08:22,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900806803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:22,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:22,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:08:22,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884387232] [2022-07-13 22:08:22,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:22,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:08:22,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:22,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:08:22,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:08:22,485 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-13 22:08:22,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 258 transitions, 3415 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:22,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:22,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-13 22:08:22,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:22,984 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][185], [Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), 62#L72true, Black: 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 296#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 304#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 165#true, 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 28#L61true, Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 865#true, Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 850#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 852#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 846#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|))]) [2022-07-13 22:08:22,984 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-07-13 22:08:22,984 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-13 22:08:22,984 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-13 22:08:22,985 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-13 22:08:23,206 INFO L129 PetriNetUnfolder]: 1293/4073 cut-off events. [2022-07-13 22:08:23,206 INFO L130 PetriNetUnfolder]: For 41940/42635 co-relation queries the response was YES. [2022-07-13 22:08:23,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18787 conditions, 4073 events. 1293/4073 cut-off events. For 41940/42635 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 37842 event pairs, 166 based on Foata normal form. 188/3819 useless extension candidates. Maximal degree in co-relation 18738. Up to 1017 conditions per place. [2022-07-13 22:08:23,283 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 43 selfloop transitions, 10 changer transitions 4/269 dead transitions. [2022-07-13 22:08:23,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 269 transitions, 3602 flow [2022-07-13 22:08:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:08:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-13 22:08:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-07-13 22:08:23,285 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8532110091743119 [2022-07-13 22:08:23,285 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 465 transitions. [2022-07-13 22:08:23,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 465 transitions. [2022-07-13 22:08:23,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:23,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 465 transitions. [2022-07-13 22:08:23,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:23,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:23,288 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:23,288 INFO L186 Difference]: Start difference. First operand has 193 places, 258 transitions, 3415 flow. Second operand 5 states and 465 transitions. [2022-07-13 22:08:23,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 269 transitions, 3602 flow [2022-07-13 22:08:23,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 269 transitions, 3486 flow, removed 55 selfloop flow, removed 5 redundant places. [2022-07-13 22:08:23,486 INFO L242 Difference]: Finished difference. Result has 188 places, 253 transitions, 3239 flow [2022-07-13 22:08:23,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3271, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3239, PETRI_PLACES=188, PETRI_TRANSITIONS=253} [2022-07-13 22:08:23,487 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 90 predicate places. [2022-07-13 22:08:23,487 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 253 transitions, 3239 flow [2022-07-13 22:08:23,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:23,488 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:23,488 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2022-07-13 22:08:23,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 22:08:23,488 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash -677892328, now seen corresponding path program 2 times [2022-07-13 22:08:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:23,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731032179] [2022-07-13 22:08:23,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 22:08:23,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:23,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731032179] [2022-07-13 22:08:23,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731032179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:08:23,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875612525] [2022-07-13 22:08:23,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:08:23,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:08:23,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:08:23,581 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-13 22:08:23,583 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-13 22:08:23,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:08:23,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:08:23,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 22:08:23,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:08:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:08:23,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:08:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 22:08:23,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875612525] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:08:23,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:08:23,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-07-13 22:08:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378962637] [2022-07-13 22:08:23,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:08:23,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:08:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:23,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:08:23,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:08:23,871 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-13 22:08:23,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 253 transitions, 3239 flow. Second operand has 9 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:23,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:23,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-13 22:08:23,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:25,098 INFO L129 PetriNetUnfolder]: 2531/7808 cut-off events. [2022-07-13 22:08:25,098 INFO L130 PetriNetUnfolder]: For 80880/81745 co-relation queries the response was YES. [2022-07-13 22:08:25,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37012 conditions, 7808 events. 2531/7808 cut-off events. For 80880/81745 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 80543 event pairs, 201 based on Foata normal form. 186/7216 useless extension candidates. Maximal degree in co-relation 36963. Up to 1105 conditions per place. [2022-07-13 22:08:25,317 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 76 selfloop transitions, 20 changer transitions 0/308 dead transitions. [2022-07-13 22:08:25,317 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 308 transitions, 3938 flow [2022-07-13 22:08:25,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:08:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 22:08:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2022-07-13 22:08:25,319 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.854521625163827 [2022-07-13 22:08:25,319 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2022-07-13 22:08:25,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2022-07-13 22:08:25,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:25,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2022-07-13 22:08:25,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:25,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:25,323 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:25,323 INFO L186 Difference]: Start difference. First operand has 188 places, 253 transitions, 3239 flow. Second operand 7 states and 652 transitions. [2022-07-13 22:08:25,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 308 transitions, 3938 flow [2022-07-13 22:08:25,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 308 transitions, 3911 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-07-13 22:08:25,625 INFO L242 Difference]: Finished difference. Result has 193 places, 265 transitions, 3437 flow [2022-07-13 22:08:25,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3223, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3437, PETRI_PLACES=193, PETRI_TRANSITIONS=265} [2022-07-13 22:08:25,626 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 95 predicate places. [2022-07-13 22:08:25,626 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 265 transitions, 3437 flow [2022-07-13 22:08:25,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.55555555555556) internal successors, (815), 9 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:25,627 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:25,627 INFO L200 CegarLoopForPetriNet]: trace histogram [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] [2022-07-13 22:08:25,653 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-13 22:08:25,852 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,SelfDestructingSolverStorable14 [2022-07-13 22:08:25,852 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:25,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash -551060997, now seen corresponding path program 1 times [2022-07-13 22:08:25,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:25,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917282404] [2022-07-13 22:08:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:25,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:08:26,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:26,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917282404] [2022-07-13 22:08:26,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917282404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:08:26,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315405219] [2022-07-13 22:08:26,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:26,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:08:26,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:08:26,029 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-13 22:08:26,030 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-13 22:08:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:26,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 22:08:26,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:08:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:08:26,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:08:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:08:26,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315405219] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:08:26,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:08:26,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2022-07-13 22:08:26,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678862116] [2022-07-13 22:08:26,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:08:26,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 22:08:26,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:26,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 22:08:26,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:08:26,425 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-07-13 22:08:26,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 265 transitions, 3437 flow. Second operand has 18 states, 18 states have (on average 77.94444444444444) internal successors, (1403), 18 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:26,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:26,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-07-13 22:08:26,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:30,652 INFO L129 PetriNetUnfolder]: 8350/20885 cut-off events. [2022-07-13 22:08:30,652 INFO L130 PetriNetUnfolder]: For 250856/252124 co-relation queries the response was YES. [2022-07-13 22:08:30,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112568 conditions, 20885 events. 8350/20885 cut-off events. For 250856/252124 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 231633 event pairs, 273 based on Foata normal form. 343/19701 useless extension candidates. Maximal degree in co-relation 112517. Up to 3153 conditions per place. [2022-07-13 22:08:31,011 INFO L132 encePairwiseOnDemand]: 95/109 looper letters, 286 selfloop transitions, 206 changer transitions 177/745 dead transitions. [2022-07-13 22:08:31,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 745 transitions, 12513 flow [2022-07-13 22:08:31,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 22:08:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-13 22:08:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1982 transitions. [2022-07-13 22:08:31,015 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7576452599388379 [2022-07-13 22:08:31,015 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1982 transitions. [2022-07-13 22:08:31,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1982 transitions. [2022-07-13 22:08:31,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:31,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1982 transitions. [2022-07-13 22:08:31,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 82.58333333333333) internal successors, (1982), 24 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:31,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 109.0) internal successors, (2725), 25 states have internal predecessors, (2725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:31,023 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 109.0) internal successors, (2725), 25 states have internal predecessors, (2725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:31,024 INFO L186 Difference]: Start difference. First operand has 193 places, 265 transitions, 3437 flow. Second operand 24 states and 1982 transitions. [2022-07-13 22:08:31,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 745 transitions, 12513 flow [2022-07-13 22:08:31,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 745 transitions, 12425 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-07-13 22:08:31,976 INFO L242 Difference]: Finished difference. Result has 226 places, 416 transitions, 6636 flow [2022-07-13 22:08:31,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=3391, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6636, PETRI_PLACES=226, PETRI_TRANSITIONS=416} [2022-07-13 22:08:31,977 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 128 predicate places. [2022-07-13 22:08:31,977 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 416 transitions, 6636 flow [2022-07-13 22:08:31,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 77.94444444444444) internal successors, (1403), 18 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:31,978 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:31,978 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2022-07-13 22:08:31,999 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-13 22:08:32,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:08:32,192 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2095513248, now seen corresponding path program 2 times [2022-07-13 22:08:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:32,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314137148] [2022-07-13 22:08:32,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:32,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:08:32,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:32,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314137148] [2022-07-13 22:08:32,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314137148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:08:32,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603077941] [2022-07-13 22:08:32,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:08:32,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:08:32,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:08:32,340 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-13 22:08:32,342 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-13 22:08:32,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:08:32,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:08:32,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 22:08:32,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:08:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 22:08:32,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:08:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:08:32,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603077941] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:08:32,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:08:32,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 9 [2022-07-13 22:08:32,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331154740] [2022-07-13 22:08:32,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:08:32,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:08:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:32,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:08:32,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:08:32,605 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2022-07-13 22:08:32,606 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 416 transitions, 6636 flow. Second operand has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:32,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:32,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2022-07-13 22:08:32,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:33,311 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][212], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2041#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 879#(<= ~c2~0 1), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), 62#L72true, Black: 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 296#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 987#(= ~c2~0 0), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 304#(<= ~c2~0 0), 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 165#true, Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 28#L61true, Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 869#(<= ~c1~0 0), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 846#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 2043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= 2 ~pos~0) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1424#true]) [2022-07-13 22:08:33,312 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is not cut-off event [2022-07-13 22:08:33,312 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-13 22:08:33,313 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-13 22:08:33,313 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is not cut-off event [2022-07-13 22:08:33,729 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][285], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2041#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 987#(= ~c2~0 0), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), Black: 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 296#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), 27#L87true, Black: 304#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 165#true, Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 28#L61true, Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), 879#(<= ~c2~0 1), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 869#(<= ~c1~0 0), 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 115#true, 848#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0)), Black: 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 2033#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 2043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= 2 ~pos~0) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1424#true]) [2022-07-13 22:08:33,729 INFO L384 tUnfolder$Statistics]: this new event has 75 ancestors and is not cut-off event [2022-07-13 22:08:33,729 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-07-13 22:08:33,729 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-07-13 22:08:33,730 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is not cut-off event [2022-07-13 22:08:33,958 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([350] thread3ENTRY-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][282], [Black: 2025#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 2017#(and (<= 0 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), Black: 122#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 2039#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 127#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 2041#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1768#(not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)), Black: 2031#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2029#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 2035#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 2021#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (not (<= (mod ~v_assert~0 256) 0))), Black: 2013#(and (<= 1 ~pos~0) (not (<= (mod ~v_assert~0 256) 0))), 56#L115-4true, Black: 253#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 257#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 879#(<= ~c2~0 1), Black: 259#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 254#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 987#(= ~c2~0 0), Black: 131#true, Black: 261#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 279#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= ~v_assert~0 (* 256 (div ~v_assert~0 256)))), Black: 154#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 156#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (div |thread1Thread1of1ForFork0_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork0_~cond~0#1|) (<= 0 ~pos~0)), 72#L96true, Black: 148#(<= 0 ~pos~0), Black: 294#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), 62#L72true, Black: 296#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 136#(<= (+ (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)) 1) |thread1Thread1of1ForFork0_~cond~0#1|), Black: 304#(<= ~c2~0 0), Black: 171#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 291#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), Black: 165#true, Black: 176#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 174#(and (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), 28#L61true, 169#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 167#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 195#(and (<= ~c1~0 ~pos~0) (<= 0 ~pos~0)), 2063#(<= ~c1~0 1), Black: 830#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 840#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 832#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 874#true, Black: 314#(<= 1 ~pos~0), Black: 838#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 836#(and (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= 0 ~pos~0)), Black: 834#(and (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 213#(= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|), Black: 313#(<= 0 ~pos~0), Black: 219#(and (<= |thread1Thread1of1ForFork0_~cond~0#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 842#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 0 ~pos~0)), Black: 217#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (= ~v_assert~0 |thread1Thread1of1ForFork0_~cond~0#1|)), Black: 869#(<= ~c1~0 0), 266#(and (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 115#true, Black: 236#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), Black: 229#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256)))), 846#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 234#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) |thread1Thread1of1ForFork0_~cond~0#1|) (+ |thread2Thread1of1ForFork1_~cond~1#1| (* 256 (div |thread1Thread1of1ForFork0_~cond~0#1| 256))))), Black: 230#(<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|), Black: 228#(= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|), Black: 232#(and (= ~v_assert~0 |thread2Thread1of1ForFork1_~cond~1#1|) (<= (+ (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork1_~cond~1#1|)), 2033#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 2015#(and (= ~pos~0 0) (= ~pos~0 ~c2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0) (= ~pos~0 ~c1~0)), Black: 2043#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork1_~cond~1#1|) (<= 2 ~pos~0) (<= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 1424#true]) [2022-07-13 22:08:33,958 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-07-13 22:08:33,958 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-07-13 22:08:33,958 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-07-13 22:08:33,958 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-07-13 22:08:36,886 INFO L129 PetriNetUnfolder]: 7517/23503 cut-off events. [2022-07-13 22:08:36,887 INFO L130 PetriNetUnfolder]: For 406186/410623 co-relation queries the response was YES. [2022-07-13 22:08:37,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131221 conditions, 23503 events. 7517/23503 cut-off events. For 406186/410623 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 289350 event pairs, 668 based on Foata normal form. 827/22197 useless extension candidates. Maximal degree in co-relation 131157. Up to 3493 conditions per place. [2022-07-13 22:08:37,219 INFO L132 encePairwiseOnDemand]: 102/109 looper letters, 241 selfloop transitions, 52 changer transitions 11/559 dead transitions. [2022-07-13 22:08:37,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 559 transitions, 9418 flow [2022-07-13 22:08:37,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:08:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 22:08:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2022-07-13 22:08:37,221 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8623853211009175 [2022-07-13 22:08:37,221 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2022-07-13 22:08:37,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2022-07-13 22:08:37,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:37,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2022-07-13 22:08:37,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:37,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:37,224 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:37,224 INFO L186 Difference]: Start difference. First operand has 226 places, 416 transitions, 6636 flow. Second operand 7 states and 658 transitions. [2022-07-13 22:08:37,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 559 transitions, 9418 flow [2022-07-13 22:08:39,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 559 transitions, 8475 flow, removed 462 selfloop flow, removed 5 redundant places. [2022-07-13 22:08:39,660 INFO L242 Difference]: Finished difference. Result has 229 places, 432 transitions, 6590 flow [2022-07-13 22:08:39,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=5977, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6590, PETRI_PLACES=229, PETRI_TRANSITIONS=432} [2022-07-13 22:08:39,661 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 131 predicate places. [2022-07-13 22:08:39,661 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 432 transitions, 6590 flow [2022-07-13 22:08:39,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.77777777777777) internal successors, (817), 9 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:39,662 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:39,662 INFO L200 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 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] [2022-07-13 22:08:39,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 22:08:39,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 22:08:39,874 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:39,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:39,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2082952329, now seen corresponding path program 3 times [2022-07-13 22:08:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:39,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788699999] [2022-07-13 22:08:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:39,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 22:08:39,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:39,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788699999] [2022-07-13 22:08:39,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788699999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:08:39,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:08:39,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:08:39,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054475612] [2022-07-13 22:08:39,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:08:39,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:08:39,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:39,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:08:39,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:08:39,997 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 109 [2022-07-13 22:08:39,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 432 transitions, 6590 flow. Second operand has 8 states, 8 states have (on average 80.125) internal successors, (641), 8 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:39,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:39,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 109 [2022-07-13 22:08:39,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:08:46,280 INFO L129 PetriNetUnfolder]: 13549/34794 cut-off events. [2022-07-13 22:08:46,281 INFO L130 PetriNetUnfolder]: For 607767/611600 co-relation queries the response was YES. [2022-07-13 22:08:47,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204166 conditions, 34794 events. 13549/34794 cut-off events. For 607767/611600 co-relation queries the response was YES. Maximal size of possible extension queue 1731. Compared 424557 event pairs, 1437 based on Foata normal form. 841/33167 useless extension candidates. Maximal degree in co-relation 204101. Up to 13330 conditions per place. [2022-07-13 22:08:47,222 INFO L132 encePairwiseOnDemand]: 97/109 looper letters, 285 selfloop transitions, 56 changer transitions 211/665 dead transitions. [2022-07-13 22:08:47,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 665 transitions, 12078 flow [2022-07-13 22:08:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:08:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-13 22:08:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 914 transitions. [2022-07-13 22:08:47,223 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.762301918265221 [2022-07-13 22:08:47,224 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 914 transitions. [2022-07-13 22:08:47,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 914 transitions. [2022-07-13 22:08:47,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:08:47,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 914 transitions. [2022-07-13 22:08:47,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 83.0909090909091) internal successors, (914), 11 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:47,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:47,227 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 109.0) internal successors, (1308), 12 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:47,227 INFO L186 Difference]: Start difference. First operand has 229 places, 432 transitions, 6590 flow. Second operand 11 states and 914 transitions. [2022-07-13 22:08:47,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 665 transitions, 12078 flow [2022-07-13 22:08:53,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 665 transitions, 11932 flow, removed 63 selfloop flow, removed 3 redundant places. [2022-07-13 22:08:53,026 INFO L242 Difference]: Finished difference. Result has 241 places, 378 transitions, 5577 flow [2022-07-13 22:08:53,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=6509, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5577, PETRI_PLACES=241, PETRI_TRANSITIONS=378} [2022-07-13 22:08:53,027 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 143 predicate places. [2022-07-13 22:08:53,027 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 378 transitions, 5577 flow [2022-07-13 22:08:53,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.125) internal successors, (641), 8 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:53,027 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:08:53,027 INFO L200 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2022-07-13 22:08:53,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 22:08:53,028 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-13 22:08:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:08:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash -4919890, now seen corresponding path program 3 times [2022-07-13 22:08:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:08:53,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673963179] [2022-07-13 22:08:53,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:08:53,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:08:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:08:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 22:08:53,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:08:53,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673963179] [2022-07-13 22:08:53,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673963179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:08:53,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215063262] [2022-07-13 22:08:53,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 22:08:53,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:08:53,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:08:53,155 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-13 22:08:53,156 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-13 22:08:53,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-13 22:08:53,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:08:53,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 22:08:53,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:08:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 22:08:53,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:08:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-13 22:08:53,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215063262] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:08:53,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:08:53,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2022-07-13 22:08:53,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921973043] [2022-07-13 22:08:53,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:08:53,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 22:08:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:08:53,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 22:08:53,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:08:53,556 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2022-07-13 22:08:53,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 378 transitions, 5577 flow. Second operand has 16 states, 16 states have (on average 81.9375) internal successors, (1311), 16 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:08:53,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:08:53,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2022-07-13 22:08:53,558 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand