./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i --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/goblint-regression/28-race_reach_42-trylock2_racefree.i -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 844ba080c7d33529db727776ee230d62edb7b62a6350a8061572438c458d73d3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:57:21,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:57:21,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:57:21,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:57:21,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:57:21,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:57:21,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:57:21,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:57:21,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:57:21,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:57:21,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:57:21,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:57:21,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:57:21,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:57:21,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:57:21,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:57:21,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:57:21,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:57:21,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:57:21,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:57:21,251 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:57:21,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:57:21,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:57:21,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:57:21,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:57:21,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:57:21,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:57:21,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:57:21,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:57:21,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:57:21,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:57:21,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:57:21,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:57:21,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:57:21,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:57:21,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:57:21,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:57:21,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:57:21,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:57:21,264 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:57:21,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:57:21,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:57:21,267 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:57:21,289 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:57:21,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:57:21,290 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:57:21,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:57:21,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:57:21,291 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:57:21,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:57:21,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:57:21,292 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:57:21,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:57:21,292 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:57:21,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:57:21,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:57:21,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:57:21,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:57:21,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:57:21,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:57:21,293 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:57:21,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:57:21,294 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:57:21,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:57:21,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:57:21,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:57:21,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:57:21,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:57:21,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:57:21,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:57:21,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:57:21,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:57:21,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:57:21,301 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:57:21,301 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:57:21,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:57:21,301 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 -> 844ba080c7d33529db727776ee230d62edb7b62a6350a8061572438c458d73d3 [2022-07-13 21:57:21,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:57:21,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:57:21,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:57:21,542 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:57:21,542 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:57:21,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i [2022-07-13 21:57:21,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb4a3b6f/744d39b44f354d8f9ba038c9e708c062/FLAG1e529c6bc [2022-07-13 21:57:22,004 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:57:22,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i [2022-07-13 21:57:22,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb4a3b6f/744d39b44f354d8f9ba038c9e708c062/FLAG1e529c6bc [2022-07-13 21:57:22,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb4a3b6f/744d39b44f354d8f9ba038c9e708c062 [2022-07-13 21:57:22,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:57:22,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:57:22,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:57:22,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:57:22,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:57:22,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63eb7c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22, skipping insertion in model container [2022-07-13 21:57:22,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:57:22,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:57:22,573 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/goblint-regression/28-race_reach_42-trylock2_racefree.i[30176,30189] [2022-07-13 21:57:22,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:57:22,611 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:57:22,633 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/goblint-regression/28-race_reach_42-trylock2_racefree.i[30176,30189] [2022-07-13 21:57:22,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:57:22,666 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:57:22,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22 WrapperNode [2022-07-13 21:57:22,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:57:22,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:57:22,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:57:22,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:57:22,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,717 INFO L137 Inliner]: procedures = 171, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 130 [2022-07-13 21:57:22,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:57:22,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:57:22,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:57:22,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:57:22,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:57:22,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:57:22,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:57:22,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:57:22,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22" (1/1) ... [2022-07-13 21:57:22,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:57:22,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:22,803 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 21:57:22,804 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 21:57:22,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 21:57:22,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:57:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-13 21:57:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:57:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:57:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-13 21:57:22,833 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-13 21:57:22,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:57:22,834 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2022-07-13 21:57:22,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:57:22,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:57:22,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:57:22,835 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 21:57:22,980 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:57:22,981 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:57:23,220 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:57:23,226 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:57:23,229 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2022-07-13 21:57:23,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:57:23 BoogieIcfgContainer [2022-07-13 21:57:23,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:57:23,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:57:23,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:57:23,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:57:23,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:57:22" (1/3) ... [2022-07-13 21:57:23,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653c1d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:57:23, skipping insertion in model container [2022-07-13 21:57:23,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:22" (2/3) ... [2022-07-13 21:57:23,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653c1d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:57:23, skipping insertion in model container [2022-07-13 21:57:23,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:57:23" (3/3) ... [2022-07-13 21:57:23,239 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_42-trylock2_racefree.i [2022-07-13 21:57:23,243 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:57:23,249 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:57:23,250 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-07-13 21:57:23,250 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:57:23,307 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-07-13 21:57:23,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 170 places, 196 transitions, 400 flow [2022-07-13 21:57:23,420 INFO L129 PetriNetUnfolder]: 45/290 cut-off events. [2022-07-13 21:57:23,420 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-13 21:57:23,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 290 events. 45/290 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1129 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 152. Up to 6 conditions per place. [2022-07-13 21:57:23,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 196 transitions, 400 flow [2022-07-13 21:57:23,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 191 transitions, 387 flow [2022-07-13 21:57:23,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:57:23,471 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@1100075c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23bb950b [2022-07-13 21:57:23,471 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-13 21:57:23,512 INFO L129 PetriNetUnfolder]: 8/105 cut-off events. [2022-07-13 21:57:23,512 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:57:23,512 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:23,513 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] [2022-07-13 21:57:23,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:23,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash -892218331, now seen corresponding path program 1 times [2022-07-13 21:57:23,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:23,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883413318] [2022-07-13 21:57:23,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:23,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:23,699 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 21:57:23,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:23,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883413318] [2022-07-13 21:57:23,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883413318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:23,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:23,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:57:23,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768007714] [2022-07-13 21:57:23,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:23,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:57:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:23,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:57:23,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:57:23,730 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 196 [2022-07-13 21:57:23,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 191 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 21:57:23,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:23,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 196 [2022-07-13 21:57:23,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:23,773 INFO L129 PetriNetUnfolder]: 1/164 cut-off events. [2022-07-13 21:57:23,773 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:57:23,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 164 events. 1/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 147 event pairs, 0 based on Foata normal form. 44/201 useless extension candidates. Maximal degree in co-relation 126. Up to 6 conditions per place. [2022-07-13 21:57:23,777 INFO L132 encePairwiseOnDemand]: 166/196 looper letters, 8 selfloop transitions, 2 changer transitions 15/162 dead transitions. [2022-07-13 21:57:23,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 162 transitions, 349 flow [2022-07-13 21:57:23,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:57:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:57:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2022-07-13 21:57:23,788 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8826530612244898 [2022-07-13 21:57:23,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2022-07-13 21:57:23,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2022-07-13 21:57:23,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:23,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2022-07-13 21:57:23,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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 21:57:23,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 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 21:57:23,800 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 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 21:57:23,801 INFO L186 Difference]: Start difference. First operand has 166 places, 191 transitions, 387 flow. Second operand 3 states and 519 transitions. [2022-07-13 21:57:23,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 162 transitions, 349 flow [2022-07-13 21:57:23,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 162 transitions, 349 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:23,806 INFO L242 Difference]: Finished difference. Result has 165 places, 145 transitions, 303 flow [2022-07-13 21:57:23,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=165, PETRI_TRANSITIONS=145} [2022-07-13 21:57:23,810 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, -1 predicate places. [2022-07-13 21:57:23,810 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 145 transitions, 303 flow [2022-07-13 21:57:23,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 21:57:23,811 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:23,811 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] [2022-07-13 21:57:23,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:57:23,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1885180906, now seen corresponding path program 1 times [2022-07-13 21:57:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:23,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179955111] [2022-07-13 21:57:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:23,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:57:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:23,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:57:23,887 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:57:23,888 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-07-13 21:57:23,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-13 21:57:23,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-07-13 21:57:23,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-07-13 21:57:23,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-13 21:57:23,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:57:23,890 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-13 21:57:23,893 WARN L231 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-13 21:57:23,893 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-07-13 21:57:23,908 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-13 21:57:23,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 214 places, 251 transitions, 520 flow [2022-07-13 21:57:23,968 INFO L129 PetriNetUnfolder]: 76/464 cut-off events. [2022-07-13 21:57:23,969 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-13 21:57:23,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 464 events. 76/464 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2049 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 292. Up to 9 conditions per place. [2022-07-13 21:57:23,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 251 transitions, 520 flow [2022-07-13 21:57:23,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 214 places, 251 transitions, 520 flow [2022-07-13 21:57:23,979 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:57:23,980 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@1100075c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23bb950b [2022-07-13 21:57:23,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-13 21:57:23,986 INFO L129 PetriNetUnfolder]: 8/109 cut-off events. [2022-07-13 21:57:23,986 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:57:23,986 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:23,986 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] [2022-07-13 21:57:23,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:23,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1906173221, now seen corresponding path program 1 times [2022-07-13 21:57:23,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:23,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539937730] [2022-07-13 21:57:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:23,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:24,025 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 21:57:24,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:24,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539937730] [2022-07-13 21:57:24,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539937730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:24,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:24,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:57:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353992952] [2022-07-13 21:57:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:24,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:57:24,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:24,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:57:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:57:24,028 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 251 [2022-07-13 21:57:24,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 251 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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 21:57:24,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:24,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 251 [2022-07-13 21:57:24,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:24,105 INFO L129 PetriNetUnfolder]: 4/320 cut-off events. [2022-07-13 21:57:24,105 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-07-13 21:57:24,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 320 events. 4/320 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 779 event pairs, 0 based on Foata normal form. 128/432 useless extension candidates. Maximal degree in co-relation 226. Up to 16 conditions per place. [2022-07-13 21:57:24,107 INFO L132 encePairwiseOnDemand]: 209/251 looper letters, 11 selfloop transitions, 2 changer transitions 21/212 dead transitions. [2022-07-13 21:57:24,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 212 transitions, 472 flow [2022-07-13 21:57:24,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:57:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:57:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2022-07-13 21:57:24,113 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8751660026560425 [2022-07-13 21:57:24,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 659 transitions. [2022-07-13 21:57:24,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 659 transitions. [2022-07-13 21:57:24,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:24,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 659 transitions. [2022-07-13 21:57:24,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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 21:57:24,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states 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 21:57:24,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states 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 21:57:24,118 INFO L186 Difference]: Start difference. First operand has 214 places, 251 transitions, 520 flow. Second operand 3 states and 659 transitions. [2022-07-13 21:57:24,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 212 transitions, 472 flow [2022-07-13 21:57:24,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 212 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:24,126 INFO L242 Difference]: Finished difference. Result has 213 places, 188 transitions, 398 flow [2022-07-13 21:57:24,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=213, PETRI_TRANSITIONS=188} [2022-07-13 21:57:24,128 INFO L279 CegarLoopForPetriNet]: 214 programPoint places, -1 predicate places. [2022-07-13 21:57:24,128 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 188 transitions, 398 flow [2022-07-13 21:57:24,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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 21:57:24,128 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:24,128 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] [2022-07-13 21:57:24,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:57:24,129 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1025915671, now seen corresponding path program 1 times [2022-07-13 21:57:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:24,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482186401] [2022-07-13 21:57:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:24,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:24,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482186401] [2022-07-13 21:57:24,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482186401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:24,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245625768] [2022-07-13 21:57:24,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:24,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:24,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:24,217 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 21:57:24,218 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 21:57:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:24,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 21:57:24,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:24,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:24,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245625768] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:24,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:24,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-13 21:57:24,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191159590] [2022-07-13 21:57:24,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:24,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:57:24,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:57:24,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:57:24,438 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 251 [2022-07-13 21:57:24,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 188 transitions, 398 flow. Second operand has 10 states, 10 states have (on average 198.3) internal successors, (1983), 10 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states 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 21:57:24,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:24,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 251 [2022-07-13 21:57:24,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:24,514 INFO L129 PetriNetUnfolder]: 0/144 cut-off events. [2022-07-13 21:57:24,515 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-13 21:57:24,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 144 events. 0/144 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 121 event pairs, 0 based on Foata normal form. 2/146 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-07-13 21:57:24,516 INFO L132 encePairwiseOnDemand]: 246/251 looper letters, 9 selfloop transitions, 7 changer transitions 0/138 dead transitions. [2022-07-13 21:57:24,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 138 transitions, 328 flow [2022-07-13 21:57:24,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:57:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:57:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1782 transitions. [2022-07-13 21:57:24,520 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7888446215139442 [2022-07-13 21:57:24,520 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1782 transitions. [2022-07-13 21:57:24,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1782 transitions. [2022-07-13 21:57:24,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:24,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1782 transitions. [2022-07-13 21:57:24,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states 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 21:57:24,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states 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 21:57:24,528 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states 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 21:57:24,529 INFO L186 Difference]: Start difference. First operand has 213 places, 188 transitions, 398 flow. Second operand 9 states and 1782 transitions. [2022-07-13 21:57:24,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 138 transitions, 328 flow [2022-07-13 21:57:24,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 138 transitions, 324 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:24,533 INFO L242 Difference]: Finished difference. Result has 146 places, 134 transitions, 298 flow [2022-07-13 21:57:24,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=298, PETRI_PLACES=146, PETRI_TRANSITIONS=134} [2022-07-13 21:57:24,537 INFO L279 CegarLoopForPetriNet]: 214 programPoint places, -68 predicate places. [2022-07-13 21:57:24,537 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 134 transitions, 298 flow [2022-07-13 21:57:24,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 198.3) internal successors, (1983), 10 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states 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 21:57:24,538 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:24,539 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2022-07-13 21:57:24,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 21:57:24,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:24,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:24,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1234493863, now seen corresponding path program 1 times [2022-07-13 21:57:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:24,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686611146] [2022-07-13 21:57:24,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:24,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:24,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:57:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:24,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:57:24,792 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:57:24,792 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-07-13 21:57:24,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-13 21:57:24,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-07-13 21:57:24,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-07-13 21:57:24,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-13 21:57:24,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:57:24,793 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-13 21:57:24,793 WARN L231 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-13 21:57:24,793 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-07-13 21:57:24,817 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-13 21:57:24,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 258 places, 306 transitions, 642 flow [2022-07-13 21:57:24,886 INFO L129 PetriNetUnfolder]: 112/671 cut-off events. [2022-07-13 21:57:24,886 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-07-13 21:57:24,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 671 events. 112/671 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3150 event pairs, 1 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 472. Up to 16 conditions per place. [2022-07-13 21:57:24,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 306 transitions, 642 flow [2022-07-13 21:57:24,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 306 transitions, 642 flow [2022-07-13 21:57:24,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:57:24,904 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@1100075c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23bb950b [2022-07-13 21:57:24,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-13 21:57:24,909 INFO L129 PetriNetUnfolder]: 6/99 cut-off events. [2022-07-13 21:57:24,910 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:57:24,910 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:24,910 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:57:24,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:24,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:24,910 INFO L85 PathProgramCache]: Analyzing trace with hash -670988188, now seen corresponding path program 1 times [2022-07-13 21:57:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:24,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151034757] [2022-07-13 21:57:24,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:24,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:24,943 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 21:57:24,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:24,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151034757] [2022-07-13 21:57:24,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151034757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:24,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:24,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:57:24,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999092916] [2022-07-13 21:57:24,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:24,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 21:57:24,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:24,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 21:57:24,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 21:57:24,949 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 306 [2022-07-13 21:57:24,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 306 transitions, 642 flow. Second operand has 2 states, 2 states have (on average 245.5) internal successors, (491), 2 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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 21:57:24,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:24,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 306 [2022-07-13 21:57:24,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:25,019 INFO L129 PetriNetUnfolder]: 12/555 cut-off events. [2022-07-13 21:57:25,019 INFO L130 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-07-13 21:57:25,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 555 events. 12/555 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2135 event pairs, 1 based on Foata normal form. 218/741 useless extension candidates. Maximal degree in co-relation 396. Up to 16 conditions per place. [2022-07-13 21:57:25,023 INFO L132 encePairwiseOnDemand]: 255/306 looper letters, 3 selfloop transitions, 0 changer transitions 22/251 dead transitions. [2022-07-13 21:57:25,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 251 transitions, 544 flow [2022-07-13 21:57:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 21:57:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-13 21:57:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 547 transitions. [2022-07-13 21:57:25,035 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8937908496732027 [2022-07-13 21:57:25,035 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 547 transitions. [2022-07-13 21:57:25,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 547 transitions. [2022-07-13 21:57:25,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:25,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 547 transitions. [2022-07-13 21:57:25,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 273.5) internal successors, (547), 2 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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 21:57:25,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states 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 21:57:25,039 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states 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 21:57:25,039 INFO L186 Difference]: Start difference. First operand has 258 places, 306 transitions, 642 flow. Second operand 2 states and 547 transitions. [2022-07-13 21:57:25,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 251 transitions, 544 flow [2022-07-13 21:57:25,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 251 transitions, 544 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:25,043 INFO L242 Difference]: Finished difference. Result has 255 places, 229 transitions, 479 flow [2022-07-13 21:57:25,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=479, PETRI_PLACES=255, PETRI_TRANSITIONS=229} [2022-07-13 21:57:25,045 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -3 predicate places. [2022-07-13 21:57:25,045 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 229 transitions, 479 flow [2022-07-13 21:57:25,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 245.5) internal successors, (491), 2 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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 21:57:25,045 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:25,045 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] [2022-07-13 21:57:25,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:57:25,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:25,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1827027749, now seen corresponding path program 1 times [2022-07-13 21:57:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:25,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091364237] [2022-07-13 21:57:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:25,090 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 21:57:25,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:25,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091364237] [2022-07-13 21:57:25,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091364237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:25,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:25,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:57:25,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706346608] [2022-07-13 21:57:25,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:25,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:57:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:25,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:57:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:57:25,093 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 306 [2022-07-13 21:57:25,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 229 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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 21:57:25,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:25,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 306 [2022-07-13 21:57:25,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:25,149 INFO L129 PetriNetUnfolder]: 3/363 cut-off events. [2022-07-13 21:57:25,149 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-07-13 21:57:25,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 363 events. 3/363 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1217 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 397. Up to 18 conditions per place. [2022-07-13 21:57:25,152 INFO L132 encePairwiseOnDemand]: 303/306 looper letters, 12 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2022-07-13 21:57:25,153 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 233 transitions, 515 flow [2022-07-13 21:57:25,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:57:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:57:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2022-07-13 21:57:25,156 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2022-07-13 21:57:25,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 729 transitions. [2022-07-13 21:57:25,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 729 transitions. [2022-07-13 21:57:25,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:25,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 729 transitions. [2022-07-13 21:57:25,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 states 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 21:57:25,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:57:25,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:57:25,161 INFO L186 Difference]: Start difference. First operand has 255 places, 229 transitions, 479 flow. Second operand 3 states and 729 transitions. [2022-07-13 21:57:25,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 233 transitions, 515 flow [2022-07-13 21:57:25,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 233 transitions, 509 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:25,168 INFO L242 Difference]: Finished difference. Result has 239 places, 230 transitions, 485 flow [2022-07-13 21:57:25,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=239, PETRI_TRANSITIONS=230} [2022-07-13 21:57:25,169 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -19 predicate places. [2022-07-13 21:57:25,171 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 230 transitions, 485 flow [2022-07-13 21:57:25,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states 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 21:57:25,171 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:25,171 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] [2022-07-13 21:57:25,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:57:25,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:25,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:25,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2032357282, now seen corresponding path program 1 times [2022-07-13 21:57:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:25,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828078905] [2022-07-13 21:57:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:25,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:25,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828078905] [2022-07-13 21:57:25,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828078905] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:25,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230467450] [2022-07-13 21:57:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:25,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:25,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:25,218 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 21:57:25,219 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 21:57:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:25,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 21:57:25,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:25,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:25,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:25,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230467450] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:25,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:25,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-13 21:57:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230647041] [2022-07-13 21:57:25,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:25,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:57:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:25,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:57:25,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:57:25,367 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 306 [2022-07-13 21:57:25,369 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 230 transitions, 485 flow. Second operand has 10 states, 10 states have (on average 239.3) internal successors, (2393), 10 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states 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 21:57:25,369 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:25,369 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 306 [2022-07-13 21:57:25,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:25,453 INFO L129 PetriNetUnfolder]: 1/251 cut-off events. [2022-07-13 21:57:25,454 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-13 21:57:25,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 251 events. 1/251 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 503 event pairs, 0 based on Foata normal form. 2/249 useless extension candidates. Maximal degree in co-relation 289. Up to 7 conditions per place. [2022-07-13 21:57:25,456 INFO L132 encePairwiseOnDemand]: 300/306 looper letters, 13 selfloop transitions, 9 changer transitions 0/240 dead transitions. [2022-07-13 21:57:25,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 240 transitions, 551 flow [2022-07-13 21:57:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:57:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:57:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2157 transitions. [2022-07-13 21:57:25,460 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7832244008714597 [2022-07-13 21:57:25,460 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2157 transitions. [2022-07-13 21:57:25,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2157 transitions. [2022-07-13 21:57:25,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:25,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2157 transitions. [2022-07-13 21:57:25,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 239.66666666666666) internal successors, (2157), 9 states have internal predecessors, (2157), 0 states have call successors, (0), 0 states 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 21:57:25,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 306.0) internal successors, (3060), 10 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states 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 21:57:25,469 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 306.0) internal successors, (3060), 10 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states 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 21:57:25,469 INFO L186 Difference]: Start difference. First operand has 239 places, 230 transitions, 485 flow. Second operand 9 states and 2157 transitions. [2022-07-13 21:57:25,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 240 transitions, 551 flow [2022-07-13 21:57:25,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 240 transitions, 549 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:25,473 INFO L242 Difference]: Finished difference. Result has 249 places, 236 transitions, 533 flow [2022-07-13 21:57:25,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=533, PETRI_PLACES=249, PETRI_TRANSITIONS=236} [2022-07-13 21:57:25,474 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -9 predicate places. [2022-07-13 21:57:25,474 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 236 transitions, 533 flow [2022-07-13 21:57:25,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 239.3) internal successors, (2393), 10 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states 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 21:57:25,475 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:25,476 INFO L200 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:25,494 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 21:57:25,692 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,SelfDestructingSolverStorable7 [2022-07-13 21:57:25,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash -776467533, now seen corresponding path program 1 times [2022-07-13 21:57:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:25,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576180565] [2022-07-13 21:57:25,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:25,717 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:57:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:25,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:57:25,732 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:57:25,732 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-07-13 21:57:25,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-13 21:57:25,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-07-13 21:57:25,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-07-13 21:57:25,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-13 21:57:25,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:57:25,733 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-07-13 21:57:25,733 WARN L231 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-13 21:57:25,733 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-07-13 21:57:25,752 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-13 21:57:25,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 302 places, 361 transitions, 766 flow [2022-07-13 21:57:25,874 INFO L129 PetriNetUnfolder]: 160/946 cut-off events. [2022-07-13 21:57:25,875 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-07-13 21:57:25,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 946 events. 160/946 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4656 event pairs, 6 based on Foata normal form. 0/766 useless extension candidates. Maximal degree in co-relation 691. Up to 32 conditions per place. [2022-07-13 21:57:25,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 361 transitions, 766 flow [2022-07-13 21:57:25,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 302 places, 361 transitions, 766 flow [2022-07-13 21:57:25,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:57:25,908 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@1100075c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23bb950b [2022-07-13 21:57:25,908 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-13 21:57:25,913 INFO L129 PetriNetUnfolder]: 6/100 cut-off events. [2022-07-13 21:57:25,914 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:57:25,914 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:25,914 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] [2022-07-13 21:57:25,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:25,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:25,915 INFO L85 PathProgramCache]: Analyzing trace with hash 667296612, now seen corresponding path program 1 times [2022-07-13 21:57:25,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:25,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980265228] [2022-07-13 21:57:25,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:25,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:25,938 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 21:57:25,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:25,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980265228] [2022-07-13 21:57:25,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980265228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:25,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:25,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:57:25,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187822591] [2022-07-13 21:57:25,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:25,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 21:57:25,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:25,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 21:57:25,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 21:57:25,942 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 361 [2022-07-13 21:57:25,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 361 transitions, 766 flow. Second operand has 2 states, 2 states have (on average 286.5) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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 21:57:25,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:25,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 361 [2022-07-13 21:57:25,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:26,044 INFO L129 PetriNetUnfolder]: 26/792 cut-off events. [2022-07-13 21:57:26,045 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-07-13 21:57:26,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 792 events. 26/792 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3587 event pairs, 6 based on Foata normal form. 497/1243 useless extension candidates. Maximal degree in co-relation 590. Up to 37 conditions per place. [2022-07-13 21:57:26,053 INFO L132 encePairwiseOnDemand]: 298/361 looper letters, 4 selfloop transitions, 0 changer transitions 23/294 dead transitions. [2022-07-13 21:57:26,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 294 transitions, 648 flow [2022-07-13 21:57:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 21:57:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-13 21:57:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 643 transitions. [2022-07-13 21:57:26,055 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8905817174515236 [2022-07-13 21:57:26,055 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 643 transitions. [2022-07-13 21:57:26,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 643 transitions. [2022-07-13 21:57:26,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:26,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 643 transitions. [2022-07-13 21:57:26,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 321.5) internal successors, (643), 2 states have internal predecessors, (643), 0 states have call successors, (0), 0 states 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 21:57:26,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states 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 21:57:26,058 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states 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 21:57:26,058 INFO L186 Difference]: Start difference. First operand has 302 places, 361 transitions, 766 flow. Second operand 2 states and 643 transitions. [2022-07-13 21:57:26,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 294 transitions, 648 flow [2022-07-13 21:57:26,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 294 transitions, 648 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:26,081 INFO L242 Difference]: Finished difference. Result has 299 places, 271 transitions, 574 flow [2022-07-13 21:57:26,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=574, PETRI_PLACES=299, PETRI_TRANSITIONS=271} [2022-07-13 21:57:26,082 INFO L279 CegarLoopForPetriNet]: 302 programPoint places, -3 predicate places. [2022-07-13 21:57:26,082 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 271 transitions, 574 flow [2022-07-13 21:57:26,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 286.5) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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 21:57:26,082 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:26,082 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] [2022-07-13 21:57:26,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 21:57:26,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1129654747, now seen corresponding path program 1 times [2022-07-13 21:57:26,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:26,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887239873] [2022-07-13 21:57:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:26,119 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 21:57:26,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:26,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887239873] [2022-07-13 21:57:26,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887239873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:26,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:26,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:57:26,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544612771] [2022-07-13 21:57:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:26,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:57:26,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:26,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:57:26,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:57:26,122 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 361 [2022-07-13 21:57:26,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 271 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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 21:57:26,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:26,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 361 [2022-07-13 21:57:26,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:26,196 INFO L129 PetriNetUnfolder]: 4/470 cut-off events. [2022-07-13 21:57:26,196 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-07-13 21:57:26,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 470 events. 4/470 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1835 event pairs, 0 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 516. Up to 24 conditions per place. [2022-07-13 21:57:26,202 INFO L132 encePairwiseOnDemand]: 358/361 looper letters, 13 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2022-07-13 21:57:26,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 275 transitions, 612 flow [2022-07-13 21:57:26,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:57:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:57:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2022-07-13 21:57:26,205 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7876269621421976 [2022-07-13 21:57:26,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 853 transitions. [2022-07-13 21:57:26,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 853 transitions. [2022-07-13 21:57:26,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:26,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 853 transitions. [2022-07-13 21:57:26,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states 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 21:57:26,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states 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 21:57:26,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states 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 21:57:26,209 INFO L186 Difference]: Start difference. First operand has 299 places, 271 transitions, 574 flow. Second operand 3 states and 853 transitions. [2022-07-13 21:57:26,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 275 transitions, 612 flow [2022-07-13 21:57:26,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 275 transitions, 600 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:26,215 INFO L242 Difference]: Finished difference. Result has 283 places, 272 transitions, 574 flow [2022-07-13 21:57:26,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=283, PETRI_TRANSITIONS=272} [2022-07-13 21:57:26,217 INFO L279 CegarLoopForPetriNet]: 302 programPoint places, -19 predicate places. [2022-07-13 21:57:26,217 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 272 transitions, 574 flow [2022-07-13 21:57:26,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states 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 21:57:26,218 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:26,218 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] [2022-07-13 21:57:26,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:57:26,218 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:26,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:26,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1054315315, now seen corresponding path program 1 times [2022-07-13 21:57:26,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:26,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448753951] [2022-07-13 21:57:26,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:26,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:26,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:26,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448753951] [2022-07-13 21:57:26,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448753951] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:26,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034024384] [2022-07-13 21:57:26,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:26,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:26,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:26,253 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 21:57:26,254 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 21:57:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:26,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 21:57:26,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:26,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:26,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034024384] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:26,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:26,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-13 21:57:26,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714700723] [2022-07-13 21:57:26,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:26,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:57:26,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:26,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:57:26,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:57:26,393 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 361 [2022-07-13 21:57:26,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 272 transitions, 574 flow. Second operand has 10 states, 10 states have (on average 280.3) internal successors, (2803), 10 states have internal predecessors, (2803), 0 states have call successors, (0), 0 states 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 21:57:26,395 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:26,395 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 361 [2022-07-13 21:57:26,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:26,489 INFO L129 PetriNetUnfolder]: 2/358 cut-off events. [2022-07-13 21:57:26,489 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-13 21:57:26,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 358 events. 2/358 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1071 event pairs, 0 based on Foata normal form. 2/352 useless extension candidates. Maximal degree in co-relation 408. Up to 11 conditions per place. [2022-07-13 21:57:26,493 INFO L132 encePairwiseOnDemand]: 355/361 looper letters, 14 selfloop transitions, 9 changer transitions 0/282 dead transitions. [2022-07-13 21:57:26,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 282 transitions, 642 flow [2022-07-13 21:57:26,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:57:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:57:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2527 transitions. [2022-07-13 21:57:26,498 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2022-07-13 21:57:26,498 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2527 transitions. [2022-07-13 21:57:26,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2527 transitions. [2022-07-13 21:57:26,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:26,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2527 transitions. [2022-07-13 21:57:26,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 280.77777777777777) internal successors, (2527), 9 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states 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 21:57:26,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 0 states have call successors, (0), 0 states 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 21:57:26,507 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 0 states have call successors, (0), 0 states 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 21:57:26,507 INFO L186 Difference]: Start difference. First operand has 283 places, 272 transitions, 574 flow. Second operand 9 states and 2527 transitions. [2022-07-13 21:57:26,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 282 transitions, 642 flow [2022-07-13 21:57:26,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 282 transitions, 640 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:26,511 INFO L242 Difference]: Finished difference. Result has 293 places, 278 transitions, 622 flow [2022-07-13 21:57:26,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=622, PETRI_PLACES=293, PETRI_TRANSITIONS=278} [2022-07-13 21:57:26,512 INFO L279 CegarLoopForPetriNet]: 302 programPoint places, -9 predicate places. [2022-07-13 21:57:26,512 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 278 transitions, 622 flow [2022-07-13 21:57:26,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 280.3) internal successors, (2803), 10 states have internal predecessors, (2803), 0 states have call successors, (0), 0 states 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 21:57:26,514 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:26,514 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:26,531 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 21:57:26,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:26,727 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:26,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 585911698, now seen corresponding path program 1 times [2022-07-13 21:57:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:26,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541515825] [2022-07-13 21:57:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:26,793 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 21:57:26,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:26,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541515825] [2022-07-13 21:57:26,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541515825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:26,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:26,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:57:26,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849592879] [2022-07-13 21:57:26,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:26,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:57:26,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:26,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:57:26,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:57:26,797 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 361 [2022-07-13 21:57:26,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 278 transitions, 622 flow. Second operand has 5 states, 5 states have (on average 250.6) internal successors, (1253), 5 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:57:26,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:26,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 361 [2022-07-13 21:57:26,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:53,767 INFO L129 PetriNetUnfolder]: 69512/231194 cut-off events. [2022-07-13 21:57:53,767 INFO L130 PetriNetUnfolder]: For 475/475 co-relation queries the response was YES. [2022-07-13 21:57:56,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 323415 conditions, 231194 events. 69512/231194 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 5529. Compared 3764820 event pairs, 24598 based on Foata normal form. 750/226608 useless extension candidates. Maximal degree in co-relation 323404. Up to 40763 conditions per place. [2022-07-13 21:57:57,748 INFO L132 encePairwiseOnDemand]: 340/361 looper letters, 109 selfloop transitions, 35 changer transitions 5/387 dead transitions. [2022-07-13 21:57:57,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 387 transitions, 1153 flow [2022-07-13 21:57:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:57:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:57:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2396 transitions. [2022-07-13 21:57:57,752 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7374576792859341 [2022-07-13 21:57:57,752 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2396 transitions. [2022-07-13 21:57:57,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2396 transitions. [2022-07-13 21:57:57,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:57,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2396 transitions. [2022-07-13 21:57:57,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 266.22222222222223) internal successors, (2396), 9 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:57:57,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 0 states have call successors, (0), 0 states 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 21:57:57,761 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 0 states have call successors, (0), 0 states 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 21:57:57,761 INFO L186 Difference]: Start difference. First operand has 293 places, 278 transitions, 622 flow. Second operand 9 states and 2396 transitions. [2022-07-13 21:57:57,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 387 transitions, 1153 flow [2022-07-13 21:57:57,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 387 transitions, 1147 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:57,767 INFO L242 Difference]: Finished difference. Result has 307 places, 308 transitions, 868 flow [2022-07-13 21:57:57,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=868, PETRI_PLACES=307, PETRI_TRANSITIONS=308} [2022-07-13 21:57:57,768 INFO L279 CegarLoopForPetriNet]: 302 programPoint places, 5 predicate places. [2022-07-13 21:57:57,768 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 308 transitions, 868 flow [2022-07-13 21:57:57,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 250.6) internal successors, (1253), 5 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:57:57,769 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:57,769 INFO L200 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:57,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 21:57:57,769 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash 352051992, now seen corresponding path program 1 times [2022-07-13 21:57:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:57,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772757368] [2022-07-13 21:57:57,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:57,784 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:57:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:57,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:57:57,799 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:57:57,799 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-07-13 21:57:57,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-13 21:57:57,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-07-13 21:57:57,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-07-13 21:57:57,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-13 21:57:57,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 21:57:57,800 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-13 21:57:57,800 WARN L231 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-13 21:57:57,801 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-07-13 21:57:57,820 INFO L135 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2022-07-13 21:57:57,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 346 places, 416 transitions, 892 flow [2022-07-13 21:57:57,958 INFO L129 PetriNetUnfolder]: 236/1361 cut-off events. [2022-07-13 21:57:57,958 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-07-13 21:57:57,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 1361 events. 236/1361 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7200 event pairs, 23 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 991. Up to 80 conditions per place. [2022-07-13 21:57:57,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 346 places, 416 transitions, 892 flow [2022-07-13 21:57:58,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 346 places, 416 transitions, 892 flow [2022-07-13 21:57:58,001 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:57:58,001 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@1100075c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23bb950b [2022-07-13 21:57:58,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-13 21:57:58,005 INFO L129 PetriNetUnfolder]: 6/104 cut-off events. [2022-07-13 21:57:58,005 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:57:58,005 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:58,005 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] [2022-07-13 21:57:58,005 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash -871955612, now seen corresponding path program 1 times [2022-07-13 21:57:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:58,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448523669] [2022-07-13 21:57:58,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:58,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:58,016 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 21:57:58,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:58,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448523669] [2022-07-13 21:57:58,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448523669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:58,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:58,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:57:58,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191318432] [2022-07-13 21:57:58,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:58,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 21:57:58,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:58,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 21:57:58,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 21:57:58,018 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 416 [2022-07-13 21:57:58,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 416 transitions, 892 flow. Second operand has 2 states, 2 states have (on average 327.5) internal successors, (655), 2 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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 21:57:58,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:58,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 416 [2022-07-13 21:57:58,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:58,179 INFO L129 PetriNetUnfolder]: 60/1161 cut-off events. [2022-07-13 21:57:58,179 INFO L130 PetriNetUnfolder]: For 285/285 co-relation queries the response was YES. [2022-07-13 21:57:58,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 1161 events. 60/1161 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5992 event pairs, 23 based on Foata normal form. 1132/2225 useless extension candidates. Maximal degree in co-relation 873. Up to 86 conditions per place. [2022-07-13 21:57:58,196 INFO L132 encePairwiseOnDemand]: 341/416 looper letters, 5 selfloop transitions, 0 changer transitions 24/337 dead transitions. [2022-07-13 21:57:58,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 337 transitions, 754 flow [2022-07-13 21:57:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 21:57:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-13 21:57:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 739 transitions. [2022-07-13 21:57:58,199 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8882211538461539 [2022-07-13 21:57:58,199 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 739 transitions. [2022-07-13 21:57:58,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 739 transitions. [2022-07-13 21:57:58,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:58,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 739 transitions. [2022-07-13 21:57:58,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 369.5) internal successors, (739), 2 states have internal predecessors, (739), 0 states have call successors, (0), 0 states 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 21:57:58,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:57:58,202 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:57:58,202 INFO L186 Difference]: Start difference. First operand has 346 places, 416 transitions, 892 flow. Second operand 2 states and 739 transitions. [2022-07-13 21:57:58,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 337 transitions, 754 flow [2022-07-13 21:57:58,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 337 transitions, 754 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:58,207 INFO L242 Difference]: Finished difference. Result has 343 places, 313 transitions, 671 flow [2022-07-13 21:57:58,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=671, PETRI_PLACES=343, PETRI_TRANSITIONS=313} [2022-07-13 21:57:58,208 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -3 predicate places. [2022-07-13 21:57:58,208 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 313 transitions, 671 flow [2022-07-13 21:57:58,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 327.5) internal successors, (655), 2 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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 21:57:58,209 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:58,209 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] [2022-07-13 21:57:58,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 21:57:58,209 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:58,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1626060325, now seen corresponding path program 1 times [2022-07-13 21:57:58,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:58,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959703797] [2022-07-13 21:57:58,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:58,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:58,231 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 21:57:58,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:58,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959703797] [2022-07-13 21:57:58,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959703797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:58,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:58,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:57:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296911368] [2022-07-13 21:57:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:58,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:57:58,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:57:58,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:57:58,235 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 416 [2022-07-13 21:57:58,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 313 transitions, 671 flow. Second operand has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states 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 21:57:58,236 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:58,236 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 416 [2022-07-13 21:57:58,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:58,319 INFO L129 PetriNetUnfolder]: 5/577 cut-off events. [2022-07-13 21:57:58,320 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-07-13 21:57:58,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 577 events. 5/577 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2479 event pairs, 0 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 636. Up to 30 conditions per place. [2022-07-13 21:57:58,328 INFO L132 encePairwiseOnDemand]: 413/416 looper letters, 14 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2022-07-13 21:57:58,328 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 317 transitions, 711 flow [2022-07-13 21:57:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:57:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:57:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2022-07-13 21:57:58,330 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7828525641025641 [2022-07-13 21:57:58,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 977 transitions. [2022-07-13 21:57:58,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 977 transitions. [2022-07-13 21:57:58,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:58,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 977 transitions. [2022-07-13 21:57:58,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states 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 21:57:58,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states 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 21:57:58,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states 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 21:57:58,334 INFO L186 Difference]: Start difference. First operand has 343 places, 313 transitions, 671 flow. Second operand 3 states and 977 transitions. [2022-07-13 21:57:58,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 317 transitions, 711 flow [2022-07-13 21:57:58,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 317 transitions, 691 flow, removed 10 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:58,339 INFO L242 Difference]: Finished difference. Result has 327 places, 314 transitions, 663 flow [2022-07-13 21:57:58,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=663, PETRI_PLACES=327, PETRI_TRANSITIONS=314} [2022-07-13 21:57:58,339 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -19 predicate places. [2022-07-13 21:57:58,340 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 314 transitions, 663 flow [2022-07-13 21:57:58,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states 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 21:57:58,340 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:58,340 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] [2022-07-13 21:57:58,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 21:57:58,340 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:58,341 INFO L85 PathProgramCache]: Analyzing trace with hash -355832472, now seen corresponding path program 1 times [2022-07-13 21:57:58,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:58,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504864918] [2022-07-13 21:57:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:58,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:58,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504864918] [2022-07-13 21:57:58,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504864918] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:58,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591560306] [2022-07-13 21:57:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:58,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:58,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:58,372 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 21:57:58,373 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 21:57:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:58,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 21:57:58,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:58,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:58,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591560306] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:58,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:58,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-13 21:57:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891862882] [2022-07-13 21:57:58,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:58,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:57:58,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:58,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:57:58,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:57:58,521 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 416 [2022-07-13 21:57:58,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 314 transitions, 663 flow. Second operand has 10 states, 10 states have (on average 321.3) internal successors, (3213), 10 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states 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 21:57:58,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:58,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 416 [2022-07-13 21:57:58,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:58,701 INFO L129 PetriNetUnfolder]: 3/465 cut-off events. [2022-07-13 21:57:58,701 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-07-13 21:57:58,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 465 events. 3/465 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1652 event pairs, 0 based on Foata normal form. 2/455 useless extension candidates. Maximal degree in co-relation 527. Up to 15 conditions per place. [2022-07-13 21:57:58,705 INFO L132 encePairwiseOnDemand]: 410/416 looper letters, 15 selfloop transitions, 9 changer transitions 0/324 dead transitions. [2022-07-13 21:57:58,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 324 transitions, 733 flow [2022-07-13 21:57:58,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:57:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:57:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2897 transitions. [2022-07-13 21:57:58,709 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7737713675213675 [2022-07-13 21:57:58,709 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2897 transitions. [2022-07-13 21:57:58,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2897 transitions. [2022-07-13 21:57:58,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:58,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2897 transitions. [2022-07-13 21:57:58,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 321.8888888888889) internal successors, (2897), 9 states have internal predecessors, (2897), 0 states have call successors, (0), 0 states 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 21:57:58,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 416.0) internal successors, (4160), 10 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states 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 21:57:58,718 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 416.0) internal successors, (4160), 10 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states 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 21:57:58,718 INFO L186 Difference]: Start difference. First operand has 327 places, 314 transitions, 663 flow. Second operand 9 states and 2897 transitions. [2022-07-13 21:57:58,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 324 transitions, 733 flow [2022-07-13 21:57:58,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 324 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:58,722 INFO L242 Difference]: Finished difference. Result has 337 places, 320 transitions, 711 flow [2022-07-13 21:57:58,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=711, PETRI_PLACES=337, PETRI_TRANSITIONS=320} [2022-07-13 21:57:58,723 INFO L279 CegarLoopForPetriNet]: 346 programPoint places, -9 predicate places. [2022-07-13 21:57:58,723 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 320 transitions, 711 flow [2022-07-13 21:57:58,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 321.3) internal successors, (3213), 10 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states 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 21:57:58,724 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:58,724 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:57:58,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 21:57:58,943 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 21:57:58,943 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:58,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash 399864177, now seen corresponding path program 1 times [2022-07-13 21:57:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:58,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794543936] [2022-07-13 21:57:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:58,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 21:57:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:59,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794543936] [2022-07-13 21:57:59,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794543936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:59,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:59,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 21:57:59,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848942236] [2022-07-13 21:57:59,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:59,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 21:57:59,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:59,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 21:57:59,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 21:57:59,016 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 416 [2022-07-13 21:57:59,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 320 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 287.6) internal successors, (1438), 5 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states 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 21:57:59,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:59,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 416 [2022-07-13 21:57:59,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand