/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:14:12,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:14:12,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:14:12,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:14:12,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:14:12,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:14:12,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:14:12,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:14:12,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:14:12,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:14:12,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:14:12,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:14:12,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:14:12,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:14:12,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:14:12,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:14:12,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:14:12,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:14:12,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:14:12,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:14:12,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:14:12,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:14:12,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:14:12,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:14:12,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:14:12,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:14:12,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:14:12,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:14:12,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:14:12,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:14:12,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:14:12,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:14:12,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:14:12,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:14:12,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:14:12,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:14:12,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:14:12,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:14:12,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:14:12,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:14:12,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:14:12,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:14:12,390 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:14:12,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:14:12,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:14:12,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:14:12,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:14:12,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:14:12,391 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:14:12,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:14:12,392 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:14:12,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:14:12,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:14:12,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:14:12,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:14:12,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:14:12,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:14:12,392 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:14:12,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:14:12,393 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:14:12,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:14:12,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:14:12,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:14:12,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:14:12,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:14:12,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:14:12,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:14:12,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:14:12,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:14:12,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:14:12,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:14:12,394 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:14:12,394 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:14:12,394 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 18:14:12,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:14:12,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:14:12,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:14:12,580 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:14:12,581 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:14:12,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:14:13,662 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:14:13,869 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:14:13,870 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:14:13,885 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dff2ef58/dbe4685845734574a55c1b551d4ca52f/FLAG78c9a0b31 [2023-01-27 18:14:13,896 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dff2ef58/dbe4685845734574a55c1b551d4ca52f [2023-01-27 18:14:13,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:14:13,899 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:14:13,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:14:13,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:14:13,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:14:13,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:14:13" (1/1) ... [2023-01-27 18:14:13,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53707c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:13, skipping insertion in model container [2023-01-27 18:14:13,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:14:13" (1/1) ... [2023-01-27 18:14:13,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:14:13,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:14:14,043 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/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-27 18:14:14,180 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:14:14,189 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:14:14,203 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/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-27 18:14:14,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:14:14,274 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:14:14,274 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:14:14,279 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:14:14,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14 WrapperNode [2023-01-27 18:14:14,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:14:14,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:14:14,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:14:14,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:14:14,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (1/1) ... [2023-01-27 18:14:14,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (1/1) ... [2023-01-27 18:14:14,335 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-01-27 18:14:14,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:14:14,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:14:14,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:14:14,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:14:14,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (1/1) ... [2023-01-27 18:14:14,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (1/1) ... [2023-01-27 18:14:14,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (1/1) ... [2023-01-27 18:14:14,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (1/1) ... [2023-01-27 18:14:14,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (1/1) ... [2023-01-27 18:14:14,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (1/1) ... [2023-01-27 18:14:14,368 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (1/1) ... [2023-01-27 18:14:14,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (1/1) ... [2023-01-27 18:14:14,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:14:14,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:14:14,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:14:14,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:14:14,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (1/1) ... [2023-01-27 18:14:14,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:14:14,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:14:14,407 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-01-27 18:14:14,460 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-01-27 18:14:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:14:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:14:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:14:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:14:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:14:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:14:14,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:14:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:14:14,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:14:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:14:14,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:14:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:14:14,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:14:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:14:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:14:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:14:14,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:14:14,474 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:14:14,564 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:14:14,566 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:14:14,822 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:14:14,978 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:14:14,978 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:14:14,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:14:14 BoogieIcfgContainer [2023-01-27 18:14:14,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:14:14,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:14:14,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:14:14,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:14:14,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:14:13" (1/3) ... [2023-01-27 18:14:14,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@877eb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:14:14, skipping insertion in model container [2023-01-27 18:14:14,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:14" (2/3) ... [2023-01-27 18:14:14,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@877eb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:14:14, skipping insertion in model container [2023-01-27 18:14:14,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:14:14" (3/3) ... [2023-01-27 18:14:14,987 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-01-27 18:14:14,998 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:14:14,999 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:14:14,999 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:14:15,056 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:14:15,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-01-27 18:14:15,152 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-27 18:14:15,152 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:15,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-27 18:14:15,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-01-27 18:14:15,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-01-27 18:14:15,166 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:14:15,172 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-01-27 18:14:15,174 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-01-27 18:14:15,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-01-27 18:14:15,223 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-27 18:14:15,223 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:15,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-27 18:14:15,226 INFO L119 LiptonReduction]: Number of co-enabled transitions 3058 [2023-01-27 18:14:18,553 INFO L134 LiptonReduction]: Checked pairs total: 8550 [2023-01-27 18:14:18,554 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-01-27 18:14:18,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:14:18,583 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=false, 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;@2797d538, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:14:18,584 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:14:18,586 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-27 18:14:18,587 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:18,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:18,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-27 18:14:18,589 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-01-27 18:14:18,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash 539820, now seen corresponding path program 1 times [2023-01-27 18:14:18,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:18,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821034811] [2023-01-27 18:14:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:18,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:18,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:18,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821034811] [2023-01-27 18:14:18,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821034811] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:18,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:18,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:14:18,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13640351] [2023-01-27 18:14:18,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:18,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:18,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:18,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 234 [2023-01-27 18:14:18,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-01-27 18:14:18,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:18,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 234 [2023-01-27 18:14:18,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:19,687 INFO L130 PetriNetUnfolder]: 4903/7118 cut-off events. [2023-01-27 18:14:19,687 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-01-27 18:14:19,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13966 conditions, 7118 events. 4903/7118 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 41812 event pairs, 895 based on Foata normal form. 0/6793 useless extension candidates. Maximal degree in co-relation 13954. Up to 5335 conditions per place. [2023-01-27 18:14:19,719 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 41 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-01-27 18:14:19,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 207 flow [2023-01-27 18:14:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-01-27 18:14:19,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5470085470085471 [2023-01-27 18:14:19,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-01-27 18:14:19,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-01-27 18:14:19,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:19,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-01-27 18:14:19,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-01-27 18:14:19,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:19,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:19,738 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 384 transitions. [2023-01-27 18:14:19,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 207 flow [2023-01-27 18:14:19,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:14:19,742 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-01-27 18:14:19,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-27 18:14:19,745 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-01-27 18:14:19,745 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-01-27 18:14:19,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-01-27 18:14:19,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:19,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:19,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:14:19,746 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-01-27 18:14:19,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:19,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1961823611, now seen corresponding path program 1 times [2023-01-27 18:14:19,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:19,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951198217] [2023-01-27 18:14:19,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:19,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:20,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:20,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951198217] [2023-01-27 18:14:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951198217] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:20,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:20,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:14:20,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821215621] [2023-01-27 18:14:20,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:20,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:20,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:20,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:20,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:20,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 234 [2023-01-27 18:14:20,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-01-27 18:14:20,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:20,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 234 [2023-01-27 18:14:20,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:21,347 INFO L130 PetriNetUnfolder]: 13482/18419 cut-off events. [2023-01-27 18:14:21,347 INFO L131 PetriNetUnfolder]: For 859/859 co-relation queries the response was YES. [2023-01-27 18:14:21,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38194 conditions, 18419 events. 13482/18419 cut-off events. For 859/859 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 96746 event pairs, 4784 based on Foata normal form. 529/18948 useless extension candidates. Maximal degree in co-relation 38184. Up to 10559 conditions per place. [2023-01-27 18:14:21,436 INFO L137 encePairwiseOnDemand]: 226/234 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-01-27 18:14:21,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 214 flow [2023-01-27 18:14:21,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-01-27 18:14:21,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5113960113960114 [2023-01-27 18:14:21,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-01-27 18:14:21,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-01-27 18:14:21,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:21,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-01-27 18:14:21,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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-01-27 18:14:21,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:21,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:21,441 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 359 transitions. [2023-01-27 18:14:21,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 214 flow [2023-01-27 18:14:21,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:14:21,442 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 116 flow [2023-01-27 18:14:21,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-01-27 18:14:21,443 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-01-27 18:14:21,443 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 116 flow [2023-01-27 18:14:21,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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-01-27 18:14:21,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:21,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:21,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:14:21,444 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-01-27 18:14:21,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:21,444 INFO L85 PathProgramCache]: Analyzing trace with hash -686991959, now seen corresponding path program 1 times [2023-01-27 18:14:21,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:21,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218639450] [2023-01-27 18:14:21,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:21,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:21,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:21,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218639450] [2023-01-27 18:14:21,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218639450] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:21,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:21,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:14:21,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052335782] [2023-01-27 18:14:21,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:21,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:14:21,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:21,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:14:21,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:14:21,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 234 [2023-01-27 18:14:21,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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-01-27 18:14:21,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:21,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 234 [2023-01-27 18:14:21,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:22,927 INFO L130 PetriNetUnfolder]: 13166/17991 cut-off events. [2023-01-27 18:14:22,928 INFO L131 PetriNetUnfolder]: For 6683/6683 co-relation queries the response was YES. [2023-01-27 18:14:22,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44733 conditions, 17991 events. 13166/17991 cut-off events. For 6683/6683 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 96660 event pairs, 976 based on Foata normal form. 40/18031 useless extension candidates. Maximal degree in co-relation 44721. Up to 9891 conditions per place. [2023-01-27 18:14:22,989 INFO L137 encePairwiseOnDemand]: 226/234 looper letters, 58 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2023-01-27 18:14:22,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 69 transitions, 362 flow [2023-01-27 18:14:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:14:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:14:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2023-01-27 18:14:22,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096153846153846 [2023-01-27 18:14:22,991 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 477 transitions. [2023-01-27 18:14:22,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 477 transitions. [2023-01-27 18:14:22,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:22,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 477 transitions. [2023-01-27 18:14:22,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-01-27 18:14:22,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 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-01-27 18:14:22,995 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 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-01-27 18:14:22,995 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 116 flow. Second operand 4 states and 477 transitions. [2023-01-27 18:14:22,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 69 transitions, 362 flow [2023-01-27 18:14:23,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 69 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:14:23,030 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 186 flow [2023-01-27 18:14:23,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2023-01-27 18:14:23,031 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-01-27 18:14:23,034 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 186 flow [2023-01-27 18:14:23,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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-01-27 18:14:23,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:23,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:23,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:14:23,034 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-01-27 18:14:23,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:23,035 INFO L85 PathProgramCache]: Analyzing trace with hash -686990688, now seen corresponding path program 1 times [2023-01-27 18:14:23,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:23,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810409362] [2023-01-27 18:14:23,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:23,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:23,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810409362] [2023-01-27 18:14:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810409362] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:23,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:14:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569962083] [2023-01-27 18:14:23,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:23,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:23,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:23,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:23,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 234 [2023-01-27 18:14:23,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-01-27 18:14:23,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:23,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 234 [2023-01-27 18:14:23,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:24,216 INFO L130 PetriNetUnfolder]: 10915/15496 cut-off events. [2023-01-27 18:14:24,216 INFO L131 PetriNetUnfolder]: For 11354/11507 co-relation queries the response was YES. [2023-01-27 18:14:24,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39852 conditions, 15496 events. 10915/15496 cut-off events. For 11354/11507 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 88017 event pairs, 4969 based on Foata normal form. 185/15596 useless extension candidates. Maximal degree in co-relation 39837. Up to 14327 conditions per place. [2023-01-27 18:14:24,287 INFO L137 encePairwiseOnDemand]: 230/234 looper letters, 51 selfloop transitions, 6 changer transitions 0/63 dead transitions. [2023-01-27 18:14:24,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 388 flow [2023-01-27 18:14:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-01-27 18:14:24,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5284900284900285 [2023-01-27 18:14:24,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-01-27 18:14:24,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-01-27 18:14:24,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:24,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-01-27 18:14:24,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-01-27 18:14:24,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:24,291 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:24,291 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 186 flow. Second operand 3 states and 371 transitions. [2023-01-27 18:14:24,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 388 flow [2023-01-27 18:14:24,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:14:24,305 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 244 flow [2023-01-27 18:14:24,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-01-27 18:14:24,306 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-01-27 18:14:24,306 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 244 flow [2023-01-27 18:14:24,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-01-27 18:14:24,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:24,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:24,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:14:24,306 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-01-27 18:14:24,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:24,307 INFO L85 PathProgramCache]: Analyzing trace with hash 178084860, now seen corresponding path program 1 times [2023-01-27 18:14:24,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:24,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395006574] [2023-01-27 18:14:24,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:24,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:24,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:24,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395006574] [2023-01-27 18:14:24,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395006574] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:24,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:24,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:14:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263729710] [2023-01-27 18:14:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:24,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:14:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:24,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:14:24,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:14:24,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 234 [2023-01-27 18:14:24,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 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-01-27 18:14:24,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:24,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 234 [2023-01-27 18:14:24,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:25,280 INFO L130 PetriNetUnfolder]: 8396/12320 cut-off events. [2023-01-27 18:14:25,280 INFO L131 PetriNetUnfolder]: For 10851/11578 co-relation queries the response was YES. [2023-01-27 18:14:25,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31937 conditions, 12320 events. 8396/12320 cut-off events. For 10851/11578 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 75533 event pairs, 1364 based on Foata normal form. 1277/13251 useless extension candidates. Maximal degree in co-relation 31919. Up to 7734 conditions per place. [2023-01-27 18:14:25,330 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 94 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2023-01-27 18:14:25,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 116 transitions, 772 flow [2023-01-27 18:14:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:14:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:14:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2023-01-27 18:14:25,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102564102564102 [2023-01-27 18:14:25,332 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 597 transitions. [2023-01-27 18:14:25,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 597 transitions. [2023-01-27 18:14:25,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:25,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 597 transitions. [2023-01-27 18:14:25,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 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-01-27 18:14:25,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 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-01-27 18:14:25,335 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 234.0) internal successors, (1404), 6 states have internal predecessors, (1404), 0 states have call successors, (0), 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-01-27 18:14:25,335 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 244 flow. Second operand 5 states and 597 transitions. [2023-01-27 18:14:25,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 116 transitions, 772 flow [2023-01-27 18:14:25,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 116 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:14:25,342 INFO L231 Difference]: Finished difference. Result has 53 places, 54 transitions, 313 flow [2023-01-27 18:14:25,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2023-01-27 18:14:25,343 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-01-27 18:14:25,343 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 313 flow [2023-01-27 18:14:25,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 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-01-27 18:14:25,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:25,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:25,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:14:25,343 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-01-27 18:14:25,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:25,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1917995319, now seen corresponding path program 1 times [2023-01-27 18:14:25,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:25,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451158329] [2023-01-27 18:14:25,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:25,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:25,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:25,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451158329] [2023-01-27 18:14:25,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451158329] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:25,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:25,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:14:25,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272467837] [2023-01-27 18:14:25,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:25,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:25,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 234 [2023-01-27 18:14:25,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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-01-27 18:14:25,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:25,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 234 [2023-01-27 18:14:25,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:26,883 INFO L130 PetriNetUnfolder]: 12911/19020 cut-off events. [2023-01-27 18:14:26,883 INFO L131 PetriNetUnfolder]: For 26513/26880 co-relation queries the response was YES. [2023-01-27 18:14:26,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62820 conditions, 19020 events. 12911/19020 cut-off events. For 26513/26880 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 122732 event pairs, 5774 based on Foata normal form. 514/19208 useless extension candidates. Maximal degree in co-relation 62798. Up to 9896 conditions per place. [2023-01-27 18:14:26,994 INFO L137 encePairwiseOnDemand]: 231/234 looper letters, 65 selfloop transitions, 8 changer transitions 9/87 dead transitions. [2023-01-27 18:14:26,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 635 flow [2023-01-27 18:14:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:26,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-01-27 18:14:26,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5313390313390314 [2023-01-27 18:14:26,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-01-27 18:14:26,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-01-27 18:14:26,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:26,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-01-27 18:14:26,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-01-27 18:14:26,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:26,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:27,000 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 313 flow. Second operand 3 states and 373 transitions. [2023-01-27 18:14:27,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 635 flow [2023-01-27 18:14:27,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:14:27,044 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 306 flow [2023-01-27 18:14:27,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2023-01-27 18:14:27,046 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-01-27 18:14:27,046 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 306 flow [2023-01-27 18:14:27,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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-01-27 18:14:27,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:27,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:27,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:14:27,046 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-01-27 18:14:27,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash -956306870, now seen corresponding path program 1 times [2023-01-27 18:14:27,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:27,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652314720] [2023-01-27 18:14:27,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:27,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:27,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652314720] [2023-01-27 18:14:27,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652314720] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:27,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:27,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:14:27,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647019823] [2023-01-27 18:14:27,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:27,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:14:27,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:27,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:14:27,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:14:27,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 234 [2023-01-27 18:14:27,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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-01-27 18:14:27,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:27,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 234 [2023-01-27 18:14:27,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:28,401 INFO L130 PetriNetUnfolder]: 8861/13435 cut-off events. [2023-01-27 18:14:28,402 INFO L131 PetriNetUnfolder]: For 17306/17937 co-relation queries the response was YES. [2023-01-27 18:14:28,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43000 conditions, 13435 events. 8861/13435 cut-off events. For 17306/17937 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 89278 event pairs, 955 based on Foata normal form. 1193/14223 useless extension candidates. Maximal degree in co-relation 42977. Up to 4455 conditions per place. [2023-01-27 18:14:28,449 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 122 selfloop transitions, 17 changer transitions 8/157 dead transitions. [2023-01-27 18:14:28,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 157 transitions, 1187 flow [2023-01-27 18:14:28,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-01-27 18:14:28,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103785103785103 [2023-01-27 18:14:28,451 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-01-27 18:14:28,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-01-27 18:14:28,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:28,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-01-27 18:14:28,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 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-01-27 18:14:28,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:28,455 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:28,455 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 306 flow. Second operand 7 states and 836 transitions. [2023-01-27 18:14:28,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 157 transitions, 1187 flow [2023-01-27 18:14:28,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 157 transitions, 1140 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-01-27 18:14:28,496 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 422 flow [2023-01-27 18:14:28,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=422, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-01-27 18:14:28,496 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2023-01-27 18:14:28,496 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 422 flow [2023-01-27 18:14:28,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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-01-27 18:14:28,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:28,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:28,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:14:28,497 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-01-27 18:14:28,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1325102024, now seen corresponding path program 1 times [2023-01-27 18:14:28,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:28,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758186208] [2023-01-27 18:14:28,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:28,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:28,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:28,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:28,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758186208] [2023-01-27 18:14:28,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758186208] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:28,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:28,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:14:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314357092] [2023-01-27 18:14:28,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:28,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:14:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:28,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:14:28,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:14:28,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 234 [2023-01-27 18:14:28,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 422 flow. Second operand has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:28,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:28,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 234 [2023-01-27 18:14:28,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:29,739 INFO L130 PetriNetUnfolder]: 8154/12358 cut-off events. [2023-01-27 18:14:29,739 INFO L131 PetriNetUnfolder]: For 23917/24524 co-relation queries the response was YES. [2023-01-27 18:14:29,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45864 conditions, 12358 events. 8154/12358 cut-off events. For 23917/24524 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 81817 event pairs, 786 based on Foata normal form. 649/12620 useless extension candidates. Maximal degree in co-relation 45837. Up to 4219 conditions per place. [2023-01-27 18:14:29,778 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 130 selfloop transitions, 25 changer transitions 27/192 dead transitions. [2023-01-27 18:14:29,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 192 transitions, 1502 flow [2023-01-27 18:14:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 18:14:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 18:14:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1075 transitions. [2023-01-27 18:14:29,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104463437796771 [2023-01-27 18:14:29,781 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1075 transitions. [2023-01-27 18:14:29,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1075 transitions. [2023-01-27 18:14:29,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:29,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1075 transitions. [2023-01-27 18:14:29,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.44444444444444) internal successors, (1075), 9 states have internal predecessors, (1075), 0 states have call successors, (0), 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-01-27 18:14:29,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 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-01-27 18:14:29,785 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 234.0) internal successors, (2340), 10 states have internal predecessors, (2340), 0 states have call successors, (0), 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-01-27 18:14:29,785 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 422 flow. Second operand 9 states and 1075 transitions. [2023-01-27 18:14:29,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 192 transitions, 1502 flow [2023-01-27 18:14:30,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 192 transitions, 1454 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-01-27 18:14:30,317 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 536 flow [2023-01-27 18:14:30,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=536, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2023-01-27 18:14:30,317 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2023-01-27 18:14:30,317 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 536 flow [2023-01-27 18:14:30,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:30,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:30,318 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] [2023-01-27 18:14:30,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:14:30,318 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-01-27 18:14:30,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash -833736987, now seen corresponding path program 1 times [2023-01-27 18:14:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:30,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494871722] [2023-01-27 18:14:30,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:30,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:30,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494871722] [2023-01-27 18:14:30,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494871722] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:30,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:30,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:14:30,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929390523] [2023-01-27 18:14:30,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:30,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:14:30,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:30,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:14:30,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:14:30,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 234 [2023-01-27 18:14:30,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 536 flow. Second operand has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 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-01-27 18:14:30,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:30,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 234 [2023-01-27 18:14:30,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:31,609 INFO L130 PetriNetUnfolder]: 7932/12064 cut-off events. [2023-01-27 18:14:31,609 INFO L131 PetriNetUnfolder]: For 26524/27130 co-relation queries the response was YES. [2023-01-27 18:14:31,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44883 conditions, 12064 events. 7932/12064 cut-off events. For 26524/27130 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 80382 event pairs, 776 based on Foata normal form. 381/12059 useless extension candidates. Maximal degree in co-relation 44853. Up to 2518 conditions per place. [2023-01-27 18:14:31,642 INFO L137 encePairwiseOnDemand]: 227/234 looper letters, 112 selfloop transitions, 29 changer transitions 44/192 dead transitions. [2023-01-27 18:14:31,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 192 transitions, 1548 flow [2023-01-27 18:14:31,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-27 18:14:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-27 18:14:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1285 transitions. [2023-01-27 18:14:31,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49922299922299923 [2023-01-27 18:14:31,645 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1285 transitions. [2023-01-27 18:14:31,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1285 transitions. [2023-01-27 18:14:31,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:31,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1285 transitions. [2023-01-27 18:14:31,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.81818181818181) internal successors, (1285), 11 states have internal predecessors, (1285), 0 states have call successors, (0), 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-01-27 18:14:31,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 234.0) internal successors, (2808), 12 states have internal predecessors, (2808), 0 states have call successors, (0), 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-01-27 18:14:31,650 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 234.0) internal successors, (2808), 12 states have internal predecessors, (2808), 0 states have call successors, (0), 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-01-27 18:14:31,651 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 536 flow. Second operand 11 states and 1285 transitions. [2023-01-27 18:14:31,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 192 transitions, 1548 flow [2023-01-27 18:14:32,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 192 transitions, 1459 flow, removed 32 selfloop flow, removed 4 redundant places. [2023-01-27 18:14:32,446 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 484 flow [2023-01-27 18:14:32,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=484, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2023-01-27 18:14:32,447 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2023-01-27 18:14:32,447 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 484 flow [2023-01-27 18:14:32,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 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-01-27 18:14:32,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:32,448 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] [2023-01-27 18:14:32,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:14:32,448 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-01-27 18:14:32,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1910436242, now seen corresponding path program 1 times [2023-01-27 18:14:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:32,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580369477] [2023-01-27 18:14:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:33,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580369477] [2023-01-27 18:14:33,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580369477] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:33,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:33,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:14:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446859230] [2023-01-27 18:14:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:33,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:14:33,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:33,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:14:33,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:14:33,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 234 [2023-01-27 18:14:33,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 484 flow. Second operand has 8 states, 8 states have (on average 104.0) internal successors, (832), 8 states have internal predecessors, (832), 0 states have call successors, (0), 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-01-27 18:14:33,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:33,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 234 [2023-01-27 18:14:33,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:34,413 INFO L130 PetriNetUnfolder]: 5762/9166 cut-off events. [2023-01-27 18:14:34,413 INFO L131 PetriNetUnfolder]: For 23643/23923 co-relation queries the response was YES. [2023-01-27 18:14:34,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35677 conditions, 9166 events. 5762/9166 cut-off events. For 23643/23923 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 62296 event pairs, 1144 based on Foata normal form. 231/9263 useless extension candidates. Maximal degree in co-relation 35643. Up to 3574 conditions per place. [2023-01-27 18:14:34,449 INFO L137 encePairwiseOnDemand]: 226/234 looper letters, 128 selfloop transitions, 6 changer transitions 56/197 dead transitions. [2023-01-27 18:14:34,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 197 transitions, 1886 flow [2023-01-27 18:14:34,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 789 transitions. [2023-01-27 18:14:34,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816849816849817 [2023-01-27 18:14:34,452 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 789 transitions. [2023-01-27 18:14:34,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 789 transitions. [2023-01-27 18:14:34,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:34,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 789 transitions. [2023-01-27 18:14:34,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 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-01-27 18:14:34,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:34,456 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 234.0) internal successors, (1872), 8 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:34,456 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 484 flow. Second operand 7 states and 789 transitions. [2023-01-27 18:14:34,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 197 transitions, 1886 flow [2023-01-27 18:14:34,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 197 transitions, 1512 flow, removed 82 selfloop flow, removed 13 redundant places. [2023-01-27 18:14:34,810 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 417 flow [2023-01-27 18:14:34,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=417, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2023-01-27 18:14:34,811 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2023-01-27 18:14:34,811 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 417 flow [2023-01-27 18:14:34,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.0) internal successors, (832), 8 states have internal predecessors, (832), 0 states have call successors, (0), 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-01-27 18:14:34,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:34,811 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] [2023-01-27 18:14:34,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:14:34,812 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-01-27 18:14:34,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -815908846, now seen corresponding path program 2 times [2023-01-27 18:14:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:34,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634412759] [2023-01-27 18:14:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:35,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:35,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634412759] [2023-01-27 18:14:35,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634412759] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:35,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:35,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:14:35,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300647919] [2023-01-27 18:14:35,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:35,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:14:35,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:35,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:14:35,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:14:35,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 234 [2023-01-27 18:14:35,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 417 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:35,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:35,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 234 [2023-01-27 18:14:35,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:36,190 INFO L130 PetriNetUnfolder]: 7020/11144 cut-off events. [2023-01-27 18:14:36,190 INFO L131 PetriNetUnfolder]: For 25426/25783 co-relation queries the response was YES. [2023-01-27 18:14:36,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41831 conditions, 11144 events. 7020/11144 cut-off events. For 25426/25783 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 76543 event pairs, 1854 based on Foata normal form. 334/11446 useless extension candidates. Maximal degree in co-relation 41805. Up to 5359 conditions per place. [2023-01-27 18:14:36,243 INFO L137 encePairwiseOnDemand]: 231/234 looper letters, 63 selfloop transitions, 1 changer transitions 74/142 dead transitions. [2023-01-27 18:14:36,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 142 transitions, 1175 flow [2023-01-27 18:14:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:14:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:14:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-01-27 18:14:36,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5149572649572649 [2023-01-27 18:14:36,256 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-01-27 18:14:36,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-01-27 18:14:36,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:36,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-01-27 18:14:36,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 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-01-27 18:14:36,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 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-01-27 18:14:36,258 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 234.0) internal successors, (1170), 5 states have internal predecessors, (1170), 0 states have call successors, (0), 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-01-27 18:14:36,259 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 417 flow. Second operand 4 states and 482 transitions. [2023-01-27 18:14:36,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 142 transitions, 1175 flow [2023-01-27 18:14:36,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 142 transitions, 1161 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-27 18:14:36,584 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 316 flow [2023-01-27 18:14:36,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=316, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2023-01-27 18:14:36,585 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2023-01-27 18:14:36,585 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 316 flow [2023-01-27 18:14:36,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:36,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:36,585 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] [2023-01-27 18:14:36,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:14:36,586 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-01-27 18:14:36,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1449880100, now seen corresponding path program 3 times [2023-01-27 18:14:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:36,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706621766] [2023-01-27 18:14:36,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:36,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:14:36,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:14:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:14:36,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:14:36,745 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:14:36,746 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:14:36,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:14:36,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:14:36,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:14:36,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:14:36,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:14:36,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:14:36,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:14:36,748 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:36,752 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:14:36,752 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:14:36,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:14:36 BasicIcfg [2023-01-27 18:14:36,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:14:36,832 INFO L158 Benchmark]: Toolchain (without parser) took 22933.46ms. Allocated memory was 702.5MB in the beginning and 3.6GB in the end (delta: 2.9GB). Free memory was 662.5MB in the beginning and 2.1GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-01-27 18:14:36,833 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 427.8MB. Free memory is still 377.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:14:36,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.29ms. Allocated memory is still 702.5MB. Free memory was 662.1MB in the beginning and 638.4MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 18:14:36,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.68ms. Allocated memory is still 702.5MB. Free memory was 638.4MB in the beginning and 636.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:14:36,833 INFO L158 Benchmark]: Boogie Preprocessor took 35.30ms. Allocated memory is still 702.5MB. Free memory was 636.0MB in the beginning and 633.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:14:36,833 INFO L158 Benchmark]: RCFGBuilder took 610.17ms. Allocated memory is still 702.5MB. Free memory was 633.9MB in the beginning and 660.2MB in the end (delta: -26.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.0GB. [2023-01-27 18:14:36,834 INFO L158 Benchmark]: TraceAbstraction took 21849.12ms. Allocated memory was 702.5MB in the beginning and 3.6GB in the end (delta: 2.9GB). Free memory was 659.1MB in the beginning and 2.1GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-01-27 18:14:36,834 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.11ms. Allocated memory is still 427.8MB. Free memory is still 377.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 380.29ms. Allocated memory is still 702.5MB. Free memory was 662.1MB in the beginning and 638.4MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.68ms. Allocated memory is still 702.5MB. Free memory was 638.4MB in the beginning and 636.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.30ms. Allocated memory is still 702.5MB. Free memory was 636.0MB in the beginning and 633.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 610.17ms. Allocated memory is still 702.5MB. Free memory was 633.9MB in the beginning and 660.2MB in the end (delta: -26.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.0GB. * TraceAbstraction took 21849.12ms. Allocated memory was 702.5MB in the beginning and 3.6GB in the end (delta: 2.9GB). Free memory was 659.1MB in the beginning and 2.1GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 135 PlacesBefore, 42 PlacesAfterwards, 124 TransitionsBefore, 30 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 8550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3126, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1643, independent: 1596, independent conditional: 0, independent unconditional: 1596, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3126, independent: 1296, independent conditional: 0, independent unconditional: 1296, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 1643, unknown conditional: 0, unknown unconditional: 1643] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1409; [L860] FCALL, FORK 0 pthread_create(&t1409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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(&t1409, ((void *)0), P0, ((void *)0))=-2, t1409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1410; [L862] FCALL, FORK 0 pthread_create(&t1410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1410, ((void *)0), P1, ((void *)0))=-1, t1409={5:0}, t1410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1411; [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 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) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 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 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 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_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L864] FCALL, FORK 0 pthread_create(&t1411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1411, ((void *)0), P2, ((void *)0))=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L865] 0 pthread_t t1412; [L866] FCALL, FORK 0 pthread_create(&t1412, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, pthread_create(&t1412, ((void *)0), P3, ((void *)0))=1, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=2, z=0] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L804] 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) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 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 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 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_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=2, z=0] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L818] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 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) [L826] 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)) [L827] 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)) [L828] 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)) [L829] 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)) [L830] 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)) [L831] 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)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=1, x=2, y=2, z=1] [L764] 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) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 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 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=1, x=2, y=2, z=1] [L837] 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) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 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 [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 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) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 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 [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 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_p2_EAX=0, __unbuffered_p3_EAX=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, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] 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_p2_EAX=0, __unbuffered_p3_EAX=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=1, x=2, y=2, 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: 860]: 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: 862]: 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: 866]: 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: 864]: 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, 164 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: 21.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 446 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 12 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=536occurred in iteration=8, InterpolantAutomatonStates: 59, 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.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 1038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-01-27 18:14:36,855 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...