./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.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 a97b4f259d777d70ea3df756a2f94b2605f52fea9df0872361c6911477a44448 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:09:22,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:09:22,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:09:22,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:09:22,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:09:22,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:09:22,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:09:22,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:09:22,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:09:22,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:09:22,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:09:22,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:09:22,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:09:22,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:09:22,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:09:22,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:09:22,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:09:22,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:09:22,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:09:22,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:09:22,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:09:22,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:09:22,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:09:22,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:09:22,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:09:22,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:09:22,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:09:22,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:09:22,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:09:22,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:09:22,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:09:22,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:09:22,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:09:22,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:09:22,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:09:22,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:09:22,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:09:22,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:09:22,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:09:22,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:09:22,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:09:22,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:09:22,453 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:09:22,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:09:22,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:09:22,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:09:22,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:09:22,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:09:22,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:09:22,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:09:22,456 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:09:22,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:09:22,457 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:09:22,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:09:22,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:09:22,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:09:22,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:09:22,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:09:22,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:09:22,458 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:09:22,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:09:22,458 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:09:22,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:09:22,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:09:22,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:09:22,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:09:22,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:09:22,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:09:22,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:09:22,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:09:22,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:09:22,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:09:22,460 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:09:22,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:09:22,461 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:09:22,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:09:22,461 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:09:22,461 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a97b4f259d777d70ea3df756a2f94b2605f52fea9df0872361c6911477a44448 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 23:09:22,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:09:22,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:09:22,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:09:22,770 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:09:22,770 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:09:22,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2023-08-30 23:09:23,966 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:09:24,168 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:09:24,169 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017.oepc.i [2023-08-30 23:09:24,182 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af703a451/b3361a16576d4ae59dffae5cf934f665/FLAGf4084fd55 [2023-08-30 23:09:24,201 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af703a451/b3361a16576d4ae59dffae5cf934f665 [2023-08-30 23:09:24,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:09:24,204 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:09:24,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:09:24,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:09:24,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:09:24,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a73c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24, skipping insertion in model container [2023-08-30 23:09:24,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:09:24,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:09:24,389 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017.oepc.i[945,958] [2023-08-30 23:09:24,520 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:09:24,533 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:09:24,548 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017.oepc.i[945,958] [2023-08-30 23:09:24,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:09:24,652 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:09:24,652 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:09:24,658 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:09:24,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24 WrapperNode [2023-08-30 23:09:24,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:09:24,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:09:24,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:09:24,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:09:24,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,733 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-30 23:09:24,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:09:24,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:09:24,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:09:24,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:09:24,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,785 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:09:24,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:09:24,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:09:24,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:09:24,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (1/1) ... [2023-08-30 23:09:24,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:09:24,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:09:24,822 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) [2023-08-30 23:09:24,852 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 [2023-08-30 23:09:24,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:09:24,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:09:24,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:09:24,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:09:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:09:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:09:24,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:09:24,866 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:09:24,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:09:24,867 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:09:24,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:09:24,867 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:09:24,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:09:24,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:09:24,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:09:24,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:09:24,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:09:24,869 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:09:25,024 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:09:25,026 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:09:25,377 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:09:25,580 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:09:25,584 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:09:25,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:09:25 BoogieIcfgContainer [2023-08-30 23:09:25,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:09:25,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:09:25,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:09:25,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:09:25,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:09:24" (1/3) ... [2023-08-30 23:09:25,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504c0ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:09:25, skipping insertion in model container [2023-08-30 23:09:25,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:09:24" (2/3) ... [2023-08-30 23:09:25,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504c0ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:09:25, skipping insertion in model container [2023-08-30 23:09:25,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:09:25" (3/3) ... [2023-08-30 23:09:25,594 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017.oepc.i [2023-08-30 23:09:25,601 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:09:25,608 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:09:25,609 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:09:25,609 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:09:25,680 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:09:25,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-08-30 23:09:25,776 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-08-30 23:09:25,779 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:09:25,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-30 23:09:25,786 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-08-30 23:09:25,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-08-30 23:09:25,794 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:09:25,802 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-30 23:09:25,804 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-30 23:09:25,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-08-30 23:09:25,834 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2023-08-30 23:09:25,834 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:09:25,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-30 23:09:25,837 INFO L119 LiptonReduction]: Number of co-enabled transitions 3164 [2023-08-30 23:09:29,691 INFO L134 LiptonReduction]: Checked pairs total: 9042 [2023-08-30 23:09:29,691 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-30 23:09:29,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:09:29,706 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13c0a510, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:09:29,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 23:09:29,709 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-30 23:09:29,709 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:09:29,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:29,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 23:09:29,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:29,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:29,714 INFO L85 PathProgramCache]: Analyzing trace with hash 553435, now seen corresponding path program 1 times [2023-08-30 23:09:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:29,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094607073] [2023-08-30 23:09:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:30,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094607073] [2023-08-30 23:09:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094607073] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:30,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:30,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:09:30,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213095047] [2023-08-30 23:09:30,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:30,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:09:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:09:30,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:09:30,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 243 [2023-08-30 23:09:30,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:30,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:30,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 243 [2023-08-30 23:09:30,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:31,051 INFO L130 PetriNetUnfolder]: 4903/6745 cut-off events. [2023-08-30 23:09:31,051 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-08-30 23:09:31,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13593 conditions, 6745 events. 4903/6745 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32689 event pairs, 2535 based on Foata normal form. 0/6407 useless extension candidates. Maximal degree in co-relation 13581. Up to 5335 conditions per place. [2023-08-30 23:09:31,085 INFO L137 encePairwiseOnDemand]: 239/243 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-08-30 23:09:31,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-08-30 23:09:31,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:09:31,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:09:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-30 23:09:31,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2023-08-30 23:09:31,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-30 23:09:31,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-30 23:09:31,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:31,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-30 23:09:31,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:31,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:31,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:31,110 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 396 transitions. [2023-08-30 23:09:31,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-08-30 23:09:31,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:09:31,115 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-30 23:09:31,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 23:09:31,120 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 23:09:31,120 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-30 23:09:31,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:31,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:31,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:31,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:09:31,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:31,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1713999878, now seen corresponding path program 1 times [2023-08-30 23:09:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:31,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504367773] [2023-08-30 23:09:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504367773] [2023-08-30 23:09:31,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504367773] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:31,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:31,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:09:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413680080] [2023-08-30 23:09:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:31,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:09:31,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:31,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:09:31,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:09:31,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 243 [2023-08-30 23:09:31,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:31,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:31,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 243 [2023-08-30 23:09:31,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:32,764 INFO L130 PetriNetUnfolder]: 9575/12870 cut-off events. [2023-08-30 23:09:32,765 INFO L131 PetriNetUnfolder]: For 653/653 co-relation queries the response was YES. [2023-08-30 23:09:32,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26710 conditions, 12870 events. 9575/12870 cut-off events. For 653/653 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 58932 event pairs, 4615 based on Foata normal form. 16/12886 useless extension candidates. Maximal degree in co-relation 26700. Up to 12679 conditions per place. [2023-08-30 23:09:32,828 INFO L137 encePairwiseOnDemand]: 237/243 looper letters, 39 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-08-30 23:09:32,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 196 flow [2023-08-30 23:09:32,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:09:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:09:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-30 23:09:32,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2023-08-30 23:09:32,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-30 23:09:32,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-30 23:09:32,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:32,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-30 23:09:32,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:32,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:32,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:32,836 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 369 transitions. [2023-08-30 23:09:32,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 196 flow [2023-08-30 23:09:32,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:32,838 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 97 flow [2023-08-30 23:09:32,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-08-30 23:09:32,839 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 23:09:32,839 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 97 flow [2023-08-30 23:09:32,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:32,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:32,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:32,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:09:32,841 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:32,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:32,841 INFO L85 PathProgramCache]: Analyzing trace with hash 733091344, now seen corresponding path program 1 times [2023-08-30 23:09:32,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:32,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415323976] [2023-08-30 23:09:32,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:32,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:33,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:33,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415323976] [2023-08-30 23:09:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415323976] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:33,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:33,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:09:33,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842003922] [2023-08-30 23:09:33,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:33,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:09:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:09:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:09:33,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 243 [2023-08-30 23:09:33,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:33,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:33,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 243 [2023-08-30 23:09:33,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:34,378 INFO L130 PetriNetUnfolder]: 8897/11994 cut-off events. [2023-08-30 23:09:34,379 INFO L131 PetriNetUnfolder]: For 2165/2165 co-relation queries the response was YES. [2023-08-30 23:09:34,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27212 conditions, 11994 events. 8897/11994 cut-off events. For 2165/2165 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 54737 event pairs, 798 based on Foata normal form. 262/12256 useless extension candidates. Maximal degree in co-relation 27201. Up to 8194 conditions per place. [2023-08-30 23:09:34,428 INFO L137 encePairwiseOnDemand]: 235/243 looper letters, 74 selfloop transitions, 14 changer transitions 0/88 dead transitions. [2023-08-30 23:09:34,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 438 flow [2023-08-30 23:09:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:09:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:09:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-08-30 23:09:34,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012345679012346 [2023-08-30 23:09:34,431 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-08-30 23:09:34,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-08-30 23:09:34,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:34,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-08-30 23:09:34,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:34,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:34,437 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:34,437 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 97 flow. Second operand 5 states and 609 transitions. [2023-08-30 23:09:34,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 438 flow [2023-08-30 23:09:34,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 88 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:09:34,440 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 189 flow [2023-08-30 23:09:34,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-08-30 23:09:34,441 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2023-08-30 23:09:34,441 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 189 flow [2023-08-30 23:09:34,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:34,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:34,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:34,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:09:34,442 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:34,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2119026181, now seen corresponding path program 1 times [2023-08-30 23:09:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:34,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528618533] [2023-08-30 23:09:34,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:34,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:34,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528618533] [2023-08-30 23:09:34,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528618533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:34,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:34,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:09:34,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016166482] [2023-08-30 23:09:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:34,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:09:34,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:34,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:09:34,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:09:34,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 23:09:34,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:34,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:34,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 23:09:34,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:35,685 INFO L130 PetriNetUnfolder]: 5068/7502 cut-off events. [2023-08-30 23:09:35,685 INFO L131 PetriNetUnfolder]: For 5758/5814 co-relation queries the response was YES. [2023-08-30 23:09:35,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19868 conditions, 7502 events. 5068/7502 cut-off events. For 5758/5814 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 42693 event pairs, 1122 based on Foata normal form. 621/7925 useless extension candidates. Maximal degree in co-relation 19853. Up to 4546 conditions per place. [2023-08-30 23:09:35,736 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 72 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2023-08-30 23:09:35,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 510 flow [2023-08-30 23:09:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:09:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:09:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-08-30 23:09:35,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160493827160494 [2023-08-30 23:09:35,739 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-08-30 23:09:35,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-08-30 23:09:35,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:35,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-08-30 23:09:35,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:35,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:35,745 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:35,745 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 189 flow. Second operand 5 states and 627 transitions. [2023-08-30 23:09:35,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 510 flow [2023-08-30 23:09:35,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 93 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:09:35,749 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 245 flow [2023-08-30 23:09:35,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-08-30 23:09:35,750 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2023-08-30 23:09:35,750 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 245 flow [2023-08-30 23:09:35,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:35,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:35,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:35,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:09:35,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:35,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:35,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1411313390, now seen corresponding path program 1 times [2023-08-30 23:09:35,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:35,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711364325] [2023-08-30 23:09:35,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:35,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:36,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711364325] [2023-08-30 23:09:36,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711364325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:36,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:36,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:09:36,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838869279] [2023-08-30 23:09:36,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:36,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:09:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:09:36,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:09:36,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 23:09:36,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:36,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:36,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 23:09:36,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:36,795 INFO L130 PetriNetUnfolder]: 4006/6121 cut-off events. [2023-08-30 23:09:36,795 INFO L131 PetriNetUnfolder]: For 7248/7270 co-relation queries the response was YES. [2023-08-30 23:09:36,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19760 conditions, 6121 events. 4006/6121 cut-off events. For 7248/7270 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 35830 event pairs, 412 based on Foata normal form. 359/6346 useless extension candidates. Maximal degree in co-relation 19741. Up to 1815 conditions per place. [2023-08-30 23:09:36,839 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 94 selfloop transitions, 19 changer transitions 0/124 dead transitions. [2023-08-30 23:09:36,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 124 transitions, 763 flow [2023-08-30 23:09:36,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:09:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:09:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 880 transitions. [2023-08-30 23:09:36,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173427395649618 [2023-08-30 23:09:36,842 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 880 transitions. [2023-08-30 23:09:36,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 880 transitions. [2023-08-30 23:09:36,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:36,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 880 transitions. [2023-08-30 23:09:36,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.71428571428571) internal successors, (880), 7 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:36,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:36,848 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:36,848 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 245 flow. Second operand 7 states and 880 transitions. [2023-08-30 23:09:36,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 124 transitions, 763 flow [2023-08-30 23:09:36,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 124 transitions, 758 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:09:36,879 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 374 flow [2023-08-30 23:09:36,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=374, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2023-08-30 23:09:36,880 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2023-08-30 23:09:36,881 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 374 flow [2023-08-30 23:09:36,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:36,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:36,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:36,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:09:36,882 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:36,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:36,882 INFO L85 PathProgramCache]: Analyzing trace with hash 832154331, now seen corresponding path program 1 times [2023-08-30 23:09:36,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:36,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630227514] [2023-08-30 23:09:36,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:36,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:37,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630227514] [2023-08-30 23:09:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630227514] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:37,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:37,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:09:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835575775] [2023-08-30 23:09:37,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:37,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:09:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:37,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:09:37,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:09:37,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 243 [2023-08-30 23:09:37,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:37,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:37,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 243 [2023-08-30 23:09:37,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:38,742 INFO L130 PetriNetUnfolder]: 6585/10558 cut-off events. [2023-08-30 23:09:38,742 INFO L131 PetriNetUnfolder]: For 25109/25333 co-relation queries the response was YES. [2023-08-30 23:09:38,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40416 conditions, 10558 events. 6585/10558 cut-off events. For 25109/25333 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 71488 event pairs, 1599 based on Foata normal form. 150/10491 useless extension candidates. Maximal degree in co-relation 40393. Up to 3592 conditions per place. [2023-08-30 23:09:38,806 INFO L137 encePairwiseOnDemand]: 235/243 looper letters, 162 selfloop transitions, 11 changer transitions 7/191 dead transitions. [2023-08-30 23:09:38,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 191 transitions, 1660 flow [2023-08-30 23:09:38,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:09:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:09:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2023-08-30 23:09:38,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5246913580246914 [2023-08-30 23:09:38,809 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2023-08-30 23:09:38,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2023-08-30 23:09:38,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:38,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2023-08-30 23:09:38,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:38,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:38,814 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:38,814 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 374 flow. Second operand 6 states and 765 transitions. [2023-08-30 23:09:38,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 191 transitions, 1660 flow [2023-08-30 23:09:39,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 191 transitions, 1440 flow, removed 77 selfloop flow, removed 3 redundant places. [2023-08-30 23:09:39,317 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 401 flow [2023-08-30 23:09:39,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=401, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2023-08-30 23:09:39,318 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-08-30 23:09:39,318 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 401 flow [2023-08-30 23:09:39,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:39,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:39,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:39,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:09:39,319 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:39,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash -791226147, now seen corresponding path program 2 times [2023-08-30 23:09:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344395455] [2023-08-30 23:09:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:39,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344395455] [2023-08-30 23:09:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344395455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:39,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:39,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:09:39,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329386927] [2023-08-30 23:09:39,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:39,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:09:39,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:39,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:09:39,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:09:39,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 23:09:39,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 401 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:39,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:39,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 23:09:39,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:40,712 INFO L130 PetriNetUnfolder]: 5972/9267 cut-off events. [2023-08-30 23:09:40,713 INFO L131 PetriNetUnfolder]: For 26462/26503 co-relation queries the response was YES. [2023-08-30 23:09:40,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35500 conditions, 9267 events. 5972/9267 cut-off events. For 26462/26503 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 60031 event pairs, 501 based on Foata normal form. 260/9325 useless extension candidates. Maximal degree in co-relation 35474. Up to 2226 conditions per place. [2023-08-30 23:09:40,756 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 131 selfloop transitions, 28 changer transitions 12/182 dead transitions. [2023-08-30 23:09:40,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 182 transitions, 1429 flow [2023-08-30 23:09:40,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 23:09:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 23:09:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1131 transitions. [2023-08-30 23:09:40,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171467764060357 [2023-08-30 23:09:40,760 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1131 transitions. [2023-08-30 23:09:40,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1131 transitions. [2023-08-30 23:09:40,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:40,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1131 transitions. [2023-08-30 23:09:40,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.66666666666667) internal successors, (1131), 9 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:40,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:40,768 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:40,768 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 401 flow. Second operand 9 states and 1131 transitions. [2023-08-30 23:09:40,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 182 transitions, 1429 flow [2023-08-30 23:09:41,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 182 transitions, 1374 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:41,039 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 568 flow [2023-08-30 23:09:41,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=568, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2023-08-30 23:09:41,040 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-08-30 23:09:41,040 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 568 flow [2023-08-30 23:09:41,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:41,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:41,041 INFO L208 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] [2023-08-30 23:09:41,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:09:41,042 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:41,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1285571951, now seen corresponding path program 1 times [2023-08-30 23:09:41,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:41,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762222463] [2023-08-30 23:09:41,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:41,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:41,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:41,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762222463] [2023-08-30 23:09:41,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762222463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:41,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:41,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:09:41,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864338304] [2023-08-30 23:09:41,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:41,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:09:41,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:41,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:09:41,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:09:41,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 243 [2023-08-30 23:09:41,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 568 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:41,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:41,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 243 [2023-08-30 23:09:41,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:43,162 INFO L130 PetriNetUnfolder]: 13811/20388 cut-off events. [2023-08-30 23:09:43,163 INFO L131 PetriNetUnfolder]: For 68351/68351 co-relation queries the response was YES. [2023-08-30 23:09:43,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84387 conditions, 20388 events. 13811/20388 cut-off events. For 68351/68351 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 128440 event pairs, 2519 based on Foata normal form. 26/20414 useless extension candidates. Maximal degree in co-relation 84358. Up to 10406 conditions per place. [2023-08-30 23:09:43,223 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 103 selfloop transitions, 12 changer transitions 84/199 dead transitions. [2023-08-30 23:09:43,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 199 transitions, 1899 flow [2023-08-30 23:09:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:09:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:09:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 731 transitions. [2023-08-30 23:09:43,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013717421124828 [2023-08-30 23:09:43,225 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 731 transitions. [2023-08-30 23:09:43,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 731 transitions. [2023-08-30 23:09:43,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:43,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 731 transitions. [2023-08-30 23:09:43,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:43,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:43,232 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:43,232 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 568 flow. Second operand 6 states and 731 transitions. [2023-08-30 23:09:43,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 199 transitions, 1899 flow [2023-08-30 23:09:44,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 199 transitions, 1628 flow, removed 94 selfloop flow, removed 4 redundant places. [2023-08-30 23:09:44,822 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 422 flow [2023-08-30 23:09:44,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2023-08-30 23:09:44,823 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2023-08-30 23:09:44,823 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 422 flow [2023-08-30 23:09:44,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:44,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:44,824 INFO L208 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] [2023-08-30 23:09:44,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:09:44,824 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:44,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:44,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1192669000, now seen corresponding path program 1 times [2023-08-30 23:09:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:44,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816004034] [2023-08-30 23:09:44,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:45,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816004034] [2023-08-30 23:09:45,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816004034] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:45,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:45,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:09:45,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817377760] [2023-08-30 23:09:45,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:45,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:09:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:45,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:09:45,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:09:45,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 23:09:45,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:45,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:45,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 23:09:45,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:45,860 INFO L130 PetriNetUnfolder]: 3646/5817 cut-off events. [2023-08-30 23:09:45,860 INFO L131 PetriNetUnfolder]: For 15066/15107 co-relation queries the response was YES. [2023-08-30 23:09:45,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21758 conditions, 5817 events. 3646/5817 cut-off events. For 15066/15107 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 36975 event pairs, 639 based on Foata normal form. 86/5738 useless extension candidates. Maximal degree in co-relation 21726. Up to 2292 conditions per place. [2023-08-30 23:09:45,880 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 70 selfloop transitions, 18 changer transitions 29/127 dead transitions. [2023-08-30 23:09:45,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 127 transitions, 974 flow [2023-08-30 23:09:45,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:09:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:09:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 979 transitions. [2023-08-30 23:09:45,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036008230452675 [2023-08-30 23:09:45,883 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 979 transitions. [2023-08-30 23:09:45,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 979 transitions. [2023-08-30 23:09:45,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:45,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 979 transitions. [2023-08-30 23:09:45,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.375) internal successors, (979), 8 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:45,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:45,889 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:45,889 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 422 flow. Second operand 8 states and 979 transitions. [2023-08-30 23:09:45,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 127 transitions, 974 flow [2023-08-30 23:09:46,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 127 transitions, 911 flow, removed 24 selfloop flow, removed 7 redundant places. [2023-08-30 23:09:46,044 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 368 flow [2023-08-30 23:09:46,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=368, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2023-08-30 23:09:46,045 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places. [2023-08-30 23:09:46,045 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 368 flow [2023-08-30 23:09:46,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:46,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:46,046 INFO L208 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] [2023-08-30 23:09:46,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:09:46,047 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:46,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:46,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1888297686, now seen corresponding path program 1 times [2023-08-30 23:09:46,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:46,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891873872] [2023-08-30 23:09:46,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:46,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:47,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:47,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:47,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891873872] [2023-08-30 23:09:47,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891873872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:47,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:47,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 23:09:47,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543139740] [2023-08-30 23:09:47,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:47,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 23:09:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 23:09:47,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-30 23:09:47,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 243 [2023-08-30 23:09:47,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 368 flow. Second operand has 11 states, 11 states have (on average 101.54545454545455) internal successors, (1117), 11 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:47,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:47,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 243 [2023-08-30 23:09:47,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:48,554 INFO L130 PetriNetUnfolder]: 4277/6623 cut-off events. [2023-08-30 23:09:48,554 INFO L131 PetriNetUnfolder]: For 15324/15324 co-relation queries the response was YES. [2023-08-30 23:09:48,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26226 conditions, 6623 events. 4277/6623 cut-off events. For 15324/15324 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 37795 event pairs, 554 based on Foata normal form. 2/6625 useless extension candidates. Maximal degree in co-relation 26198. Up to 2456 conditions per place. [2023-08-30 23:09:48,585 INFO L137 encePairwiseOnDemand]: 231/243 looper letters, 161 selfloop transitions, 25 changer transitions 53/239 dead transitions. [2023-08-30 23:09:48,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 239 transitions, 1997 flow [2023-08-30 23:09:48,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 23:09:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 23:09:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1242 transitions. [2023-08-30 23:09:48,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2023-08-30 23:09:48,589 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1242 transitions. [2023-08-30 23:09:48,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1242 transitions. [2023-08-30 23:09:48,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:48,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1242 transitions. [2023-08-30 23:09:48,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 112.9090909090909) internal successors, (1242), 11 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:48,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 243.0) internal successors, (2916), 12 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:48,596 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 243.0) internal successors, (2916), 12 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:48,597 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 368 flow. Second operand 11 states and 1242 transitions. [2023-08-30 23:09:48,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 239 transitions, 1997 flow [2023-08-30 23:09:48,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 239 transitions, 1676 flow, removed 81 selfloop flow, removed 9 redundant places. [2023-08-30 23:09:48,706 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 454 flow [2023-08-30 23:09:48,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=454, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2023-08-30 23:09:48,706 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-08-30 23:09:48,707 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 454 flow [2023-08-30 23:09:48,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.54545454545455) internal successors, (1117), 11 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:48,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:48,707 INFO L208 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] [2023-08-30 23:09:48,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:09:48,708 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:48,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:48,708 INFO L85 PathProgramCache]: Analyzing trace with hash -391803120, now seen corresponding path program 2 times [2023-08-30 23:09:48,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:48,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097148887] [2023-08-30 23:09:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:48,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:48,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:48,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097148887] [2023-08-30 23:09:48,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097148887] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:48,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:48,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:09:48,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096846506] [2023-08-30 23:09:48,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:48,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:09:48,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:48,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:09:48,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:09:49,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 243 [2023-08-30 23:09:49,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 454 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:49,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:49,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 243 [2023-08-30 23:09:49,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:49,926 INFO L130 PetriNetUnfolder]: 5309/8316 cut-off events. [2023-08-30 23:09:49,926 INFO L131 PetriNetUnfolder]: For 20212/20212 co-relation queries the response was YES. [2023-08-30 23:09:49,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32997 conditions, 8316 events. 5309/8316 cut-off events. For 20212/20212 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 50335 event pairs, 783 based on Foata normal form. 2/8318 useless extension candidates. Maximal degree in co-relation 32967. Up to 3711 conditions per place. [2023-08-30 23:09:49,946 INFO L137 encePairwiseOnDemand]: 237/243 looper letters, 89 selfloop transitions, 7 changer transitions 63/159 dead transitions. [2023-08-30 23:09:49,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 159 transitions, 1361 flow [2023-08-30 23:09:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:09:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:09:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-30 23:09:49,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48628257887517146 [2023-08-30 23:09:49,951 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-30 23:09:49,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-30 23:09:49,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:49,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-30 23:09:49,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:49,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:49,955 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:49,956 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 454 flow. Second operand 6 states and 709 transitions. [2023-08-30 23:09:49,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 159 transitions, 1361 flow [2023-08-30 23:09:50,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 159 transitions, 1312 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-30 23:09:50,126 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 404 flow [2023-08-30 23:09:50,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2023-08-30 23:09:50,126 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2023-08-30 23:09:50,126 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 404 flow [2023-08-30 23:09:50,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:50,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:50,127 INFO L208 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] [2023-08-30 23:09:50,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:09:50,127 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:50,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash 630198622, now seen corresponding path program 3 times [2023-08-30 23:09:50,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:50,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957192677] [2023-08-30 23:09:50,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:50,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957192677] [2023-08-30 23:09:50,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957192677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:50,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:50,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:09:50,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731715143] [2023-08-30 23:09:50,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:50,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:09:50,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:50,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:09:50,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:09:50,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 243 [2023-08-30 23:09:50,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:50,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:50,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 243 [2023-08-30 23:09:50,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:50,957 INFO L130 PetriNetUnfolder]: 2985/4886 cut-off events. [2023-08-30 23:09:50,958 INFO L131 PetriNetUnfolder]: For 11429/11526 co-relation queries the response was YES. [2023-08-30 23:09:50,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18827 conditions, 4886 events. 2985/4886 cut-off events. For 11429/11526 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 29569 event pairs, 677 based on Foata normal form. 15/4833 useless extension candidates. Maximal degree in co-relation 18798. Up to 2520 conditions per place. [2023-08-30 23:09:50,973 INFO L137 encePairwiseOnDemand]: 240/243 looper letters, 49 selfloop transitions, 2 changer transitions 65/120 dead transitions. [2023-08-30 23:09:50,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 120 transitions, 956 flow [2023-08-30 23:09:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:09:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:09:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2023-08-30 23:09:50,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5205761316872428 [2023-08-30 23:09:50,976 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2023-08-30 23:09:50,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2023-08-30 23:09:50,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:50,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2023-08-30 23:09:50,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:50,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:50,980 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:50,980 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 404 flow. Second operand 4 states and 506 transitions. [2023-08-30 23:09:50,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 120 transitions, 956 flow [2023-08-30 23:09:51,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 946 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 23:09:51,073 INFO L231 Difference]: Finished difference. Result has 80 places, 48 transitions, 287 flow [2023-08-30 23:09:51,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=80, PETRI_TRANSITIONS=48} [2023-08-30 23:09:51,074 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2023-08-30 23:09:51,074 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 48 transitions, 287 flow [2023-08-30 23:09:51,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:51,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:51,075 INFO L208 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] [2023-08-30 23:09:51,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:09:51,075 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:51,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:51,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1048197984, now seen corresponding path program 4 times [2023-08-30 23:09:51,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:51,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028605954] [2023-08-30 23:09:51,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:51,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:09:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:09:51,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:09:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028605954] [2023-08-30 23:09:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028605954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:09:51,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:09:51,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:09:51,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539106329] [2023-08-30 23:09:51,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:09:51,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:09:51,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:09:51,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:09:51,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:09:51,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 243 [2023-08-30 23:09:51,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 48 transitions, 287 flow. Second operand has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:51,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:09:51,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 243 [2023-08-30 23:09:51,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:09:52,100 INFO L130 PetriNetUnfolder]: 1003/1724 cut-off events. [2023-08-30 23:09:52,100 INFO L131 PetriNetUnfolder]: For 4074/4121 co-relation queries the response was YES. [2023-08-30 23:09:52,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6598 conditions, 1724 events. 1003/1724 cut-off events. For 4074/4121 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8835 event pairs, 213 based on Foata normal form. 4/1702 useless extension candidates. Maximal degree in co-relation 6567. Up to 1004 conditions per place. [2023-08-30 23:09:52,108 INFO L137 encePairwiseOnDemand]: 236/243 looper letters, 65 selfloop transitions, 10 changer transitions 36/116 dead transitions. [2023-08-30 23:09:52,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 116 transitions, 869 flow [2023-08-30 23:09:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:09:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:09:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 845 transitions. [2023-08-30 23:09:52,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496766607877719 [2023-08-30 23:09:52,111 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 845 transitions. [2023-08-30 23:09:52,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 845 transitions. [2023-08-30 23:09:52,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:09:52,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 845 transitions. [2023-08-30 23:09:52,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:52,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:52,117 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:52,117 INFO L175 Difference]: Start difference. First operand has 80 places, 48 transitions, 287 flow. Second operand 7 states and 845 transitions. [2023-08-30 23:09:52,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 116 transitions, 869 flow [2023-08-30 23:09:52,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 116 transitions, 822 flow, removed 12 selfloop flow, removed 10 redundant places. [2023-08-30 23:09:52,139 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 319 flow [2023-08-30 23:09:52,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-08-30 23:09:52,140 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-08-30 23:09:52,140 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 319 flow [2023-08-30 23:09:52,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:09:52,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:09:52,141 INFO L208 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] [2023-08-30 23:09:52,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:09:52,142 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:09:52,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:09:52,142 INFO L85 PathProgramCache]: Analyzing trace with hash -345774916, now seen corresponding path program 5 times [2023-08-30 23:09:52,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:09:52,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249411921] [2023-08-30 23:09:52,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:09:52,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:09:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:09:52,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:09:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:09:52,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:09:52,298 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:09:52,299 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 23:09:52,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 23:09:52,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 23:09:52,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 23:09:52,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 23:09:52,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 23:09:52,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 23:09:52,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 23:09:52,304 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:09:52,310 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:09:52,310 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:09:52,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:09:52 BasicIcfg [2023-08-30 23:09:52,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:09:52,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:09:52,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:09:52,426 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:09:52,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:09:25" (3/4) ... [2023-08-30 23:09:52,428 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:09:52,512 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:09:52,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:09:52,512 INFO L158 Benchmark]: Toolchain (without parser) took 28308.06ms. Allocated memory was 69.2MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 37.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-30 23:09:52,513 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 69.2MB. Free memory was 46.9MB in the beginning and 46.8MB in the end (delta: 55.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:09:52,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.61ms. Allocated memory is still 69.2MB. Free memory was 37.6MB in the beginning and 33.2MB in the end (delta: 4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-30 23:09:52,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.52ms. Allocated memory is still 69.2MB. Free memory was 33.2MB in the beginning and 30.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:09:52,514 INFO L158 Benchmark]: Boogie Preprocessor took 53.87ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 30.6MB in the beginning and 65.0MB in the end (delta: -34.3MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2023-08-30 23:09:52,514 INFO L158 Benchmark]: RCFGBuilder took 798.18ms. Allocated memory is still 86.0MB. Free memory was 65.0MB in the beginning and 52.1MB in the end (delta: 12.9MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2023-08-30 23:09:52,514 INFO L158 Benchmark]: TraceAbstraction took 26835.24ms. Allocated memory was 86.0MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 51.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-08-30 23:09:52,514 INFO L158 Benchmark]: Witness Printer took 86.57ms. Allocated memory is still 2.8GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 23:09:52,516 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 69.2MB. Free memory was 46.9MB in the beginning and 46.8MB in the end (delta: 55.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.61ms. Allocated memory is still 69.2MB. Free memory was 37.6MB in the beginning and 33.2MB in the end (delta: 4.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.52ms. Allocated memory is still 69.2MB. Free memory was 33.2MB in the beginning and 30.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.87ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 30.6MB in the beginning and 65.0MB in the end (delta: -34.3MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * RCFGBuilder took 798.18ms. Allocated memory is still 86.0MB. Free memory was 65.0MB in the beginning and 52.1MB in the end (delta: 12.9MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * TraceAbstraction took 26835.24ms. Allocated memory was 86.0MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 51.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 86.57ms. Allocated memory is still 2.8GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 139 PlacesBefore, 43 PlacesAfterwards, 128 TransitionsBefore, 31 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 9042 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3676, independent: 3432, independent conditional: 0, independent unconditional: 3432, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1701, independent: 1661, independent conditional: 0, independent unconditional: 1661, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3676, independent: 1771, independent conditional: 0, independent unconditional: 1771, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 1701, unknown conditional: 0, unknown unconditional: 1701] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L868] 0 pthread_t t433; [L869] FCALL, FORK 0 pthread_create(&t433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t433, ((void *)0), P0, ((void *)0))=-3, t433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t434; [L871] FCALL, FORK 0 pthread_create(&t434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t434, ((void *)0), P1, ((void *)0))=-2, t433={5:0}, t434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t435; [L873] FCALL, FORK 0 pthread_create(&t435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t435, ((void *)0), P2, ((void *)0))=-1, t433={5:0}, t434={6:0}, t435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] 0 pthread_t t436; [L875] FCALL, FORK 0 pthread_create(&t436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t436, ((void *)0), P3, ((void *)0))=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L827] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 a$flush_delayed = weak$$choice2 [L833] 4 a$mem_tmp = a [L834] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EBX = a [L842] 4 a = a$flush_delayed ? a$mem_tmp : a [L843] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L846] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L810] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L853] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L855] 4 return 0; [L877] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L879] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L879] RET 0 assume_abort_if_not(main$tmp_guard0) [L881] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t433={5:0}, t434={6:0}, t435={7:0}, t436={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L888] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 169 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 934 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 819 mSDsluCounter, 342 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 265 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2461 IncrementalHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 77 mSDtfsCounter, 2461 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=568occurred in iteration=7, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 2490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 23:09:52,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE