/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 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 07:03:47,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 07:03:47,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 07:03:47,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 07:03:47,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 07:03:47,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 07:03:47,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 07:03:47,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 07:03:47,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 07:03:47,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 07:03:47,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 07:03:47,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 07:03:47,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 07:03:47,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 07:03:47,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 07:03:47,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 07:03:47,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 07:03:47,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 07:03:47,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 07:03:47,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 07:03:47,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 07:03:47,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 07:03:47,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 07:03:47,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 07:03:47,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 07:03:47,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 07:03:47,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 07:03:47,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 07:03:47,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 07:03:47,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 07:03:47,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 07:03:47,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 07:03:47,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 07:03:47,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 07:03:47,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 07:03:47,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 07:03:47,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 07:03:47,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 07:03:47,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 07:03:47,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 07:03:47,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 07:03:47,312 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-28 07:03:47,345 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 07:03:47,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 07:03:47,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 07:03:47,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 07:03:47,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 07:03:47,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 07:03:47,346 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 07:03:47,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 07:03:47,346 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 07:03:47,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 07:03:47,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 07:03:47,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 07:03:47,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 07:03:47,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 07:03:47,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 07:03:47,347 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 07:03:47,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 07:03:47,347 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 07:03:47,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 07:03:47,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 07:03:47,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 07:03:47,348 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 07:03:47,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 07:03:47,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:03:47,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 07:03:47,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 07:03:47,348 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 07:03:47,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 07:03:47,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 07:03:47,348 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 07:03:47,349 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 07:03:47,349 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 07:03:47,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 07:03:47,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 07:03:47,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 07:03:47,567 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 07:03:47,568 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 07:03:47,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 07:03:48,603 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 07:03:48,772 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 07:03:48,773 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 07:03:48,781 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58db3c50/c29524a487e34a91a9568eed65cc2cdc/FLAG29265ec3a [2023-01-28 07:03:48,793 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a58db3c50/c29524a487e34a91a9568eed65cc2cdc [2023-01-28 07:03:48,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 07:03:48,795 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 07:03:48,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 07:03:48,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 07:03:48,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 07:03:48,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:03:48" (1/1) ... [2023-01-28 07:03:48,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d95ed48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:48, skipping insertion in model container [2023-01-28 07:03:48,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 07:03:48" (1/1) ... [2023-01-28 07:03:48,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 07:03:48,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 07:03:48,923 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-01-28 07:03:49,089 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:03:49,099 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 07:03:49,107 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-01-28 07:03:49,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 07:03:49,181 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:03:49,181 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 07:03:49,186 INFO L208 MainTranslator]: Completed translation [2023-01-28 07:03:49,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49 WrapperNode [2023-01-28 07:03:49,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 07:03:49,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 07:03:49,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 07:03:49,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 07:03:49,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (1/1) ... [2023-01-28 07:03:49,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (1/1) ... [2023-01-28 07:03:49,241 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-01-28 07:03:49,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 07:03:49,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 07:03:49,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 07:03:49,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 07:03:49,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (1/1) ... [2023-01-28 07:03:49,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (1/1) ... [2023-01-28 07:03:49,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (1/1) ... [2023-01-28 07:03:49,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (1/1) ... [2023-01-28 07:03:49,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (1/1) ... [2023-01-28 07:03:49,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (1/1) ... [2023-01-28 07:03:49,268 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (1/1) ... [2023-01-28 07:03:49,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (1/1) ... [2023-01-28 07:03:49,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 07:03:49,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 07:03:49,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 07:03:49,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 07:03:49,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (1/1) ... [2023-01-28 07:03:49,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 07:03:49,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 07:03:49,317 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-28 07:03:49,334 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-28 07:03:49,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 07:03:49,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 07:03:49,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 07:03:49,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 07:03:49,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 07:03:49,360 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 07:03:49,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 07:03:49,361 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 07:03:49,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 07:03:49,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 07:03:49,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 07:03:49,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 07:03:49,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 07:03:49,363 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 07:03:49,498 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 07:03:49,499 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 07:03:49,728 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 07:03:49,864 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 07:03:49,864 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 07:03:49,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:03:49 BoogieIcfgContainer [2023-01-28 07:03:49,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 07:03:49,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 07:03:49,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 07:03:49,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 07:03:49,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 07:03:48" (1/3) ... [2023-01-28 07:03:49,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6c3965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:03:49, skipping insertion in model container [2023-01-28 07:03:49,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 07:03:49" (2/3) ... [2023-01-28 07:03:49,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6c3965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 07:03:49, skipping insertion in model container [2023-01-28 07:03:49,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 07:03:49" (3/3) ... [2023-01-28 07:03:49,872 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 07:03:49,884 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 07:03:49,884 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 07:03:49,884 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 07:03:49,926 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 07:03:49,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2023-01-28 07:03:49,971 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2023-01-28 07:03:49,971 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:03:49,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-01-28 07:03:49,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2023-01-28 07:03:49,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2023-01-28 07:03:49,980 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 07:03:49,986 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2023-01-28 07:03:49,988 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2023-01-28 07:03:49,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2023-01-28 07:03:50,001 INFO L130 PetriNetUnfolder]: 2/84 cut-off events. [2023-01-28 07:03:50,001 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:03:50,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-01-28 07:03:50,003 INFO L119 LiptonReduction]: Number of co-enabled transitions 1034 [2023-01-28 07:03:52,147 INFO L134 LiptonReduction]: Checked pairs total: 2756 [2023-01-28 07:03:52,147 INFO L136 LiptonReduction]: Total number of compositions: 76 [2023-01-28 07:03:52,158 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 07:03:52,165 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;@3efda5d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 07:03:52,166 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 07:03:52,175 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-01-28 07:03:52,175 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 07:03:52,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:52,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 07:03:52,176 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:03:52,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash 393810, now seen corresponding path program 1 times [2023-01-28 07:03:52,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:52,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268706112] [2023-01-28 07:03:52,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:52,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:52,460 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-28 07:03:52,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268706112] [2023-01-28 07:03:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268706112] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:52,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:52,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 07:03:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345659936] [2023-01-28 07:03:52,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:52,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:03:52,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:52,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:03:52,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:03:52,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 162 [2023-01-28 07:03:52,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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-28 07:03:52,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:52,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 162 [2023-01-28 07:03:52,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:52,621 INFO L130 PetriNetUnfolder]: 159/311 cut-off events. [2023-01-28 07:03:52,621 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 07:03:52,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 311 events. 159/311 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1410 event pairs, 18 based on Foata normal form. 16/293 useless extension candidates. Maximal degree in co-relation 595. Up to 232 conditions per place. [2023-01-28 07:03:52,625 INFO L137 encePairwiseOnDemand]: 158/162 looper letters, 21 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2023-01-28 07:03:52,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2023-01-28 07:03:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:03:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:03:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2023-01-28 07:03:52,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-01-28 07:03:52,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 252 transitions. [2023-01-28 07:03:52,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 252 transitions. [2023-01-28 07:03:52,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:52,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 252 transitions. [2023-01-28 07:03:52,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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-28 07:03:52,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-28 07:03:52,648 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-28 07:03:52,649 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 252 transitions. [2023-01-28 07:03:52,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2023-01-28 07:03:52,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:03:52,653 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-01-28 07:03:52,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-01-28 07:03:52,657 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-01-28 07:03:52,658 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-01-28 07:03:52,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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-28 07:03:52,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:52,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:52,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 07:03:52,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:03:52,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:52,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1209529008, now seen corresponding path program 1 times [2023-01-28 07:03:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852331062] [2023-01-28 07:03:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:53,537 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-28 07:03:53,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:53,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852331062] [2023-01-28 07:03:53,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852331062] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:53,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:53,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:03:53,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54320125] [2023-01-28 07:03:53,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:53,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:03:53,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:53,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:03:53,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:03:53,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 162 [2023-01-28 07:03:53,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 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-28 07:03:53,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:53,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 162 [2023-01-28 07:03:53,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:53,756 INFO L130 PetriNetUnfolder]: 229/411 cut-off events. [2023-01-28 07:03:53,756 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-01-28 07:03:53,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 411 events. 229/411 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1624 event pairs, 64 based on Foata normal form. 29/440 useless extension candidates. Maximal degree in co-relation 858. Up to 297 conditions per place. [2023-01-28 07:03:53,761 INFO L137 encePairwiseOnDemand]: 154/162 looper letters, 25 selfloop transitions, 8 changer transitions 18/51 dead transitions. [2023-01-28 07:03:53,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 51 transitions, 222 flow [2023-01-28 07:03:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 07:03:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 07:03:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 488 transitions. [2023-01-28 07:03:53,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43033509700176364 [2023-01-28 07:03:53,765 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 488 transitions. [2023-01-28 07:03:53,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 488 transitions. [2023-01-28 07:03:53,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:53,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 488 transitions. [2023-01-28 07:03:53,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 69.71428571428571) internal successors, (488), 7 states have internal predecessors, (488), 0 states have call successors, (0), 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-28 07:03:53,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 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-28 07:03:53,773 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 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-28 07:03:53,773 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 7 states and 488 transitions. [2023-01-28 07:03:53,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 51 transitions, 222 flow [2023-01-28 07:03:53,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 07:03:53,775 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 95 flow [2023-01-28 07:03:53,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=95, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-01-28 07:03:53,776 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2023-01-28 07:03:53,776 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 95 flow [2023-01-28 07:03:53,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 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-28 07:03:53,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:53,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:53,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 07:03:53,777 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:03:53,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1159300945, now seen corresponding path program 1 times [2023-01-28 07:03:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:53,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33218319] [2023-01-28 07:03:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:54,075 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-28 07:03:54,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:54,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33218319] [2023-01-28 07:03:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33218319] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:54,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:54,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:03:54,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5149753] [2023-01-28 07:03:54,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:54,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:03:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:54,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:03:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:03:54,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 162 [2023-01-28 07:03:54,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 0 states have call successors, (0), 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-28 07:03:54,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:54,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 162 [2023-01-28 07:03:54,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:54,165 INFO L130 PetriNetUnfolder]: 190/352 cut-off events. [2023-01-28 07:03:54,165 INFO L131 PetriNetUnfolder]: For 362/373 co-relation queries the response was YES. [2023-01-28 07:03:54,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 352 events. 190/352 cut-off events. For 362/373 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1387 event pairs, 62 based on Foata normal form. 29/381 useless extension candidates. Maximal degree in co-relation 1068. Up to 295 conditions per place. [2023-01-28 07:03:54,167 INFO L137 encePairwiseOnDemand]: 157/162 looper letters, 24 selfloop transitions, 3 changer transitions 11/40 dead transitions. [2023-01-28 07:03:54,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 232 flow [2023-01-28 07:03:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 07:03:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 07:03:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 368 transitions. [2023-01-28 07:03:54,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.454320987654321 [2023-01-28 07:03:54,169 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 368 transitions. [2023-01-28 07:03:54,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 368 transitions. [2023-01-28 07:03:54,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:54,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 368 transitions. [2023-01-28 07:03:54,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 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-28 07:03:54,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:54,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:54,172 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 95 flow. Second operand 5 states and 368 transitions. [2023-01-28 07:03:54,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 232 flow [2023-01-28 07:03:54,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 228 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 07:03:54,174 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 118 flow [2023-01-28 07:03:54,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-01-28 07:03:54,175 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2023-01-28 07:03:54,175 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 118 flow [2023-01-28 07:03:54,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 0 states have call successors, (0), 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-28 07:03:54,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:54,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:54,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 07:03:54,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:03:54,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:54,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1583242462, now seen corresponding path program 1 times [2023-01-28 07:03:54,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:54,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623782992] [2023-01-28 07:03:54,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:54,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:54,688 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-28 07:03:54,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:54,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623782992] [2023-01-28 07:03:54,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623782992] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:54,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:54,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:03:54,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679491496] [2023-01-28 07:03:54,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:54,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:03:54,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:54,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:03:54,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:03:54,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 162 [2023-01-28 07:03:54,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 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-28 07:03:54,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:54,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 162 [2023-01-28 07:03:54,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:54,872 INFO L130 PetriNetUnfolder]: 264/488 cut-off events. [2023-01-28 07:03:54,872 INFO L131 PetriNetUnfolder]: For 673/673 co-relation queries the response was YES. [2023-01-28 07:03:54,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 488 events. 264/488 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2142 event pairs, 47 based on Foata normal form. 27/515 useless extension candidates. Maximal degree in co-relation 1649. Up to 236 conditions per place. [2023-01-28 07:03:54,875 INFO L137 encePairwiseOnDemand]: 155/162 looper letters, 32 selfloop transitions, 8 changer transitions 12/52 dead transitions. [2023-01-28 07:03:54,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 52 transitions, 342 flow [2023-01-28 07:03:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:03:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:03:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 419 transitions. [2023-01-28 07:03:54,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43106995884773663 [2023-01-28 07:03:54,878 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 419 transitions. [2023-01-28 07:03:54,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 419 transitions. [2023-01-28 07:03:54,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:54,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 419 transitions. [2023-01-28 07:03:54,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 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-28 07:03:54,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 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-28 07:03:54,885 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 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-28 07:03:54,885 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 118 flow. Second operand 6 states and 419 transitions. [2023-01-28 07:03:54,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 52 transitions, 342 flow [2023-01-28 07:03:54,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 334 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 07:03:54,890 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 162 flow [2023-01-28 07:03:54,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-01-28 07:03:54,891 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2023-01-28 07:03:54,891 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 162 flow [2023-01-28 07:03:54,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 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-28 07:03:54,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:54,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:54,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 07:03:54,892 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:03:54,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1582259359, now seen corresponding path program 1 times [2023-01-28 07:03:54,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:54,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254847438] [2023-01-28 07:03:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:54,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:55,269 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-28 07:03:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254847438] [2023-01-28 07:03:55,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254847438] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:55,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:55,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:03:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523866718] [2023-01-28 07:03:55,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:55,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 07:03:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:55,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 07:03:55,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 07:03:55,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 162 [2023-01-28 07:03:55,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-28 07:03:55,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:55,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 162 [2023-01-28 07:03:55,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:55,381 INFO L130 PetriNetUnfolder]: 218/424 cut-off events. [2023-01-28 07:03:55,381 INFO L131 PetriNetUnfolder]: For 936/947 co-relation queries the response was YES. [2023-01-28 07:03:55,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 424 events. 218/424 cut-off events. For 936/947 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1865 event pairs, 80 based on Foata normal form. 37/461 useless extension candidates. Maximal degree in co-relation 1516. Up to 333 conditions per place. [2023-01-28 07:03:55,383 INFO L137 encePairwiseOnDemand]: 156/162 looper letters, 31 selfloop transitions, 7 changer transitions 12/52 dead transitions. [2023-01-28 07:03:55,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 385 flow [2023-01-28 07:03:55,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 07:03:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 07:03:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 447 transitions. [2023-01-28 07:03:55,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45987654320987653 [2023-01-28 07:03:55,385 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 447 transitions. [2023-01-28 07:03:55,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 447 transitions. [2023-01-28 07:03:55,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:55,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 447 transitions. [2023-01-28 07:03:55,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 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-28 07:03:55,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 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-28 07:03:55,388 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 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-28 07:03:55,388 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 162 flow. Second operand 6 states and 447 transitions. [2023-01-28 07:03:55,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 385 flow [2023-01-28 07:03:55,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 370 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-28 07:03:55,390 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 202 flow [2023-01-28 07:03:55,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-01-28 07:03:55,392 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2023-01-28 07:03:55,392 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 202 flow [2023-01-28 07:03:55,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-28 07:03:55,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:55,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:55,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 07:03:55,393 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:03:55,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:55,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1395423914, now seen corresponding path program 1 times [2023-01-28 07:03:55,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:55,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959751504] [2023-01-28 07:03:55,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:55,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:56,014 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-28 07:03:56,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:56,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959751504] [2023-01-28 07:03:56,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959751504] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:56,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:56,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 07:03:56,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471733685] [2023-01-28 07:03:56,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:56,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 07:03:56,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:56,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 07:03:56,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 07:03:56,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 162 [2023-01-28 07:03:56,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 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-28 07:03:56,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:56,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 162 [2023-01-28 07:03:56,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:56,256 INFO L130 PetriNetUnfolder]: 234/440 cut-off events. [2023-01-28 07:03:56,256 INFO L131 PetriNetUnfolder]: For 1217/1217 co-relation queries the response was YES. [2023-01-28 07:03:56,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 440 events. 234/440 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1841 event pairs, 98 based on Foata normal form. 17/457 useless extension candidates. Maximal degree in co-relation 1769. Up to 325 conditions per place. [2023-01-28 07:03:56,259 INFO L137 encePairwiseOnDemand]: 152/162 looper letters, 32 selfloop transitions, 20 changer transitions 18/70 dead transitions. [2023-01-28 07:03:56,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 579 flow [2023-01-28 07:03:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 07:03:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 07:03:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 617 transitions. [2023-01-28 07:03:56,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4231824417009602 [2023-01-28 07:03:56,261 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 617 transitions. [2023-01-28 07:03:56,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 617 transitions. [2023-01-28 07:03:56,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:56,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 617 transitions. [2023-01-28 07:03:56,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 68.55555555555556) internal successors, (617), 9 states have internal predecessors, (617), 0 states have call successors, (0), 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-28 07:03:56,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 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-28 07:03:56,265 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 162.0) internal successors, (1620), 10 states have internal predecessors, (1620), 0 states have call successors, (0), 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-28 07:03:56,265 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 202 flow. Second operand 9 states and 617 transitions. [2023-01-28 07:03:56,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 579 flow [2023-01-28 07:03:56,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 552 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-01-28 07:03:56,269 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 333 flow [2023-01-28 07:03:56,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=333, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-01-28 07:03:56,271 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2023-01-28 07:03:56,272 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 333 flow [2023-01-28 07:03:56,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 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-28 07:03:56,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:56,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:56,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 07:03:56,272 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:03:56,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1806774398, now seen corresponding path program 1 times [2023-01-28 07:03:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:56,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645418421] [2023-01-28 07:03:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:56,606 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-28 07:03:56,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:56,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645418421] [2023-01-28 07:03:56,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645418421] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:56,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:56,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 07:03:56,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109122504] [2023-01-28 07:03:56,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:56,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 07:03:56,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:56,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 07:03:56,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-28 07:03:56,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 162 [2023-01-28 07:03:56,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 63.57142857142857) internal successors, (445), 7 states have internal predecessors, (445), 0 states have call successors, (0), 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-28 07:03:56,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:56,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 162 [2023-01-28 07:03:56,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:56,875 INFO L130 PetriNetUnfolder]: 253/487 cut-off events. [2023-01-28 07:03:56,875 INFO L131 PetriNetUnfolder]: For 2712/2712 co-relation queries the response was YES. [2023-01-28 07:03:56,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2300 conditions, 487 events. 253/487 cut-off events. For 2712/2712 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2185 event pairs, 70 based on Foata normal form. 29/516 useless extension candidates. Maximal degree in co-relation 2270. Up to 280 conditions per place. [2023-01-28 07:03:56,878 INFO L137 encePairwiseOnDemand]: 152/162 looper letters, 33 selfloop transitions, 28 changer transitions 30/91 dead transitions. [2023-01-28 07:03:56,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 91 transitions, 908 flow [2023-01-28 07:03:56,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 07:03:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 07:03:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 750 transitions. [2023-01-28 07:03:56,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4208754208754209 [2023-01-28 07:03:56,890 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 750 transitions. [2023-01-28 07:03:56,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 750 transitions. [2023-01-28 07:03:56,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:56,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 750 transitions. [2023-01-28 07:03:56,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 68.18181818181819) internal successors, (750), 11 states have internal predecessors, (750), 0 states have call successors, (0), 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-28 07:03:56,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 162.0) internal successors, (1944), 12 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:56,894 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 162.0) internal successors, (1944), 12 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:56,894 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 333 flow. Second operand 11 states and 750 transitions. [2023-01-28 07:03:56,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 91 transitions, 908 flow [2023-01-28 07:03:56,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 866 flow, removed 21 selfloop flow, removed 4 redundant places. [2023-01-28 07:03:56,914 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 500 flow [2023-01-28 07:03:56,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=500, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2023-01-28 07:03:56,915 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2023-01-28 07:03:56,915 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 500 flow [2023-01-28 07:03:56,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.57142857142857) internal successors, (445), 7 states have internal predecessors, (445), 0 states have call successors, (0), 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-28 07:03:56,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:56,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:56,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 07:03:56,916 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:03:56,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:56,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1126334558, now seen corresponding path program 1 times [2023-01-28 07:03:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:56,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489273680] [2023-01-28 07:03:56,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:57,143 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-28 07:03:57,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:57,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489273680] [2023-01-28 07:03:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489273680] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 07:03:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628333669] [2023-01-28 07:03:57,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:57,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 07:03:57,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:57,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 07:03:57,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 07:03:57,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 162 [2023-01-28 07:03:57,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-28 07:03:57,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:57,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 162 [2023-01-28 07:03:57,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:57,183 INFO L130 PetriNetUnfolder]: 56/150 cut-off events. [2023-01-28 07:03:57,183 INFO L131 PetriNetUnfolder]: For 1086/1099 co-relation queries the response was YES. [2023-01-28 07:03:57,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 150 events. 56/150 cut-off events. For 1086/1099 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 568 event pairs, 13 based on Foata normal form. 24/173 useless extension candidates. Maximal degree in co-relation 840. Up to 106 conditions per place. [2023-01-28 07:03:57,184 INFO L137 encePairwiseOnDemand]: 158/162 looper letters, 32 selfloop transitions, 3 changer transitions 3/43 dead transitions. [2023-01-28 07:03:57,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 43 transitions, 509 flow [2023-01-28 07:03:57,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 07:03:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 07:03:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2023-01-28 07:03:57,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835390946502058 [2023-01-28 07:03:57,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 235 transitions. [2023-01-28 07:03:57,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 235 transitions. [2023-01-28 07:03:57,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:57,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 235 transitions. [2023-01-28 07:03:57,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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-28 07:03:57,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-28 07:03:57,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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-28 07:03:57,213 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 500 flow. Second operand 3 states and 235 transitions. [2023-01-28 07:03:57,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 43 transitions, 509 flow [2023-01-28 07:03:57,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 430 flow, removed 23 selfloop flow, removed 14 redundant places. [2023-01-28 07:03:57,217 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 288 flow [2023-01-28 07:03:57,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-01-28 07:03:57,219 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2023-01-28 07:03:57,219 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 288 flow [2023-01-28 07:03:57,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-28 07:03:57,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:57,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:57,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 07:03:57,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:03:57,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:57,221 INFO L85 PathProgramCache]: Analyzing trace with hash 197603184, now seen corresponding path program 1 times [2023-01-28 07:03:57,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:57,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838139626] [2023-01-28 07:03:57,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:57,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:57,352 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-28 07:03:57,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:57,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838139626] [2023-01-28 07:03:57,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838139626] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:57,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:57,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 07:03:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048379298] [2023-01-28 07:03:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:57,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 07:03:57,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:57,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 07:03:57,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 07:03:57,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 162 [2023-01-28 07:03:57,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 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-28 07:03:57,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:57,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 162 [2023-01-28 07:03:57,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:57,390 INFO L130 PetriNetUnfolder]: 20/69 cut-off events. [2023-01-28 07:03:57,390 INFO L131 PetriNetUnfolder]: For 244/245 co-relation queries the response was YES. [2023-01-28 07:03:57,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 69 events. 20/69 cut-off events. For 244/245 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 194 event pairs, 4 based on Foata normal form. 11/79 useless extension candidates. Maximal degree in co-relation 339. Up to 31 conditions per place. [2023-01-28 07:03:57,391 INFO L137 encePairwiseOnDemand]: 158/162 looper letters, 22 selfloop transitions, 5 changer transitions 9/39 dead transitions. [2023-01-28 07:03:57,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 396 flow [2023-01-28 07:03:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 07:03:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 07:03:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions. [2023-01-28 07:03:57,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2023-01-28 07:03:57,392 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 306 transitions. [2023-01-28 07:03:57,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 306 transitions. [2023-01-28 07:03:57,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:57,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 306 transitions. [2023-01-28 07:03:57,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 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-28 07:03:57,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 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-28 07:03:57,394 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 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-28 07:03:57,394 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 288 flow. Second operand 4 states and 306 transitions. [2023-01-28 07:03:57,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 396 flow [2023-01-28 07:03:57,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 331 flow, removed 23 selfloop flow, removed 4 redundant places. [2023-01-28 07:03:57,396 INFO L231 Difference]: Finished difference. Result has 47 places, 24 transitions, 162 flow [2023-01-28 07:03:57,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=24} [2023-01-28 07:03:57,396 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2023-01-28 07:03:57,396 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 24 transitions, 162 flow [2023-01-28 07:03:57,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 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-28 07:03:57,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:57,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:57,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 07:03:57,397 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:03:57,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash -440561854, now seen corresponding path program 1 times [2023-01-28 07:03:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:57,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417025992] [2023-01-28 07:03:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:57,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 07:03:57,971 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-28 07:03:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 07:03:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417025992] [2023-01-28 07:03:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417025992] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 07:03:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 07:03:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-28 07:03:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554478663] [2023-01-28 07:03:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 07:03:57,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-28 07:03:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 07:03:57,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-28 07:03:57,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-01-28 07:03:57,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 162 [2023-01-28 07:03:57,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 24 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 65.66666666666667) internal successors, (591), 9 states have internal predecessors, (591), 0 states have call successors, (0), 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-28 07:03:57,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 07:03:57,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 162 [2023-01-28 07:03:57,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 07:03:58,120 INFO L130 PetriNetUnfolder]: 15/56 cut-off events. [2023-01-28 07:03:58,120 INFO L131 PetriNetUnfolder]: For 140/140 co-relation queries the response was YES. [2023-01-28 07:03:58,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 56 events. 15/56 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 1 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 235. Up to 28 conditions per place. [2023-01-28 07:03:58,121 INFO L137 encePairwiseOnDemand]: 155/162 looper letters, 18 selfloop transitions, 4 changer transitions 15/38 dead transitions. [2023-01-28 07:03:58,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 38 transitions, 308 flow [2023-01-28 07:03:58,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 07:03:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 07:03:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 543 transitions. [2023-01-28 07:03:58,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41898148148148145 [2023-01-28 07:03:58,123 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 543 transitions. [2023-01-28 07:03:58,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 543 transitions. [2023-01-28 07:03:58,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 07:03:58,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 543 transitions. [2023-01-28 07:03:58,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 67.875) internal successors, (543), 8 states have internal predecessors, (543), 0 states have call successors, (0), 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-28 07:03:58,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:58,126 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 07:03:58,126 INFO L175 Difference]: Start difference. First operand has 47 places, 24 transitions, 162 flow. Second operand 8 states and 543 transitions. [2023-01-28 07:03:58,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 38 transitions, 308 flow [2023-01-28 07:03:58,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 38 transitions, 251 flow, removed 12 selfloop flow, removed 11 redundant places. [2023-01-28 07:03:58,128 INFO L231 Difference]: Finished difference. Result has 44 places, 20 transitions, 103 flow [2023-01-28 07:03:58,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=103, PETRI_PLACES=44, PETRI_TRANSITIONS=20} [2023-01-28 07:03:58,128 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2023-01-28 07:03:58,128 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 20 transitions, 103 flow [2023-01-28 07:03:58,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.66666666666667) internal successors, (591), 9 states have internal predecessors, (591), 0 states have call successors, (0), 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-28 07:03:58,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 07:03:58,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:58,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 07:03:58,129 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 07:03:58,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 07:03:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 879104578, now seen corresponding path program 2 times [2023-01-28 07:03:58,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 07:03:58,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316918556] [2023-01-28 07:03:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 07:03:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 07:03:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:03:58,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 07:03:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 07:03:58,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 07:03:58,190 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 07:03:58,191 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 07:03:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 07:03:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 07:03:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 07:03:58,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 07:03:58,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 07:03:58,194 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 07:03:58,198 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 07:03:58,198 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 07:03:58,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 07:03:58 BasicIcfg [2023-01-28 07:03:58,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 07:03:58,232 INFO L158 Benchmark]: Toolchain (without parser) took 9436.76ms. Allocated memory was 343.9MB in the beginning and 604.0MB in the end (delta: 260.0MB). Free memory was 301.7MB in the beginning and 464.6MB in the end (delta: -162.9MB). Peak memory consumption was 98.8MB. Max. memory is 16.0GB. [2023-01-28 07:03:58,232 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 07:03:58,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.36ms. Allocated memory is still 343.9MB. Free memory was 301.7MB in the beginning and 279.1MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 07:03:58,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.85ms. Allocated memory is still 343.9MB. Free memory was 279.1MB in the beginning and 276.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:03:58,233 INFO L158 Benchmark]: Boogie Preprocessor took 29.44ms. Allocated memory is still 343.9MB. Free memory was 276.7MB in the beginning and 275.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 07:03:58,233 INFO L158 Benchmark]: RCFGBuilder took 594.85ms. Allocated memory is still 343.9MB. Free memory was 275.0MB in the beginning and 310.6MB in the end (delta: -35.6MB). Peak memory consumption was 31.7MB. Max. memory is 16.0GB. [2023-01-28 07:03:58,234 INFO L158 Benchmark]: TraceAbstraction took 8364.12ms. Allocated memory was 343.9MB in the beginning and 604.0MB in the end (delta: 260.0MB). Free memory was 309.8MB in the beginning and 464.6MB in the end (delta: -154.8MB). Peak memory consumption was 104.8MB. Max. memory is 16.0GB. [2023-01-28 07:03:58,235 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.08ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 390.36ms. Allocated memory is still 343.9MB. Free memory was 301.7MB in the beginning and 279.1MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.85ms. Allocated memory is still 343.9MB. Free memory was 279.1MB in the beginning and 276.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.44ms. Allocated memory is still 343.9MB. Free memory was 276.7MB in the beginning and 275.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 594.85ms. Allocated memory is still 343.9MB. Free memory was 275.0MB in the beginning and 310.6MB in the end (delta: -35.6MB). Peak memory consumption was 31.7MB. Max. memory is 16.0GB. * TraceAbstraction took 8364.12ms. Allocated memory was 343.9MB in the beginning and 604.0MB in the end (delta: 260.0MB). Free memory was 309.8MB in the beginning and 464.6MB in the end (delta: -154.8MB). Peak memory consumption was 104.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 89 PlacesBefore, 26 PlacesAfterwards, 84 TransitionsBefore, 20 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 2756 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1130, independent: 1006, independent conditional: 0, independent unconditional: 1006, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 555, independent: 533, independent conditional: 0, independent unconditional: 533, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1130, independent: 473, independent conditional: 0, independent unconditional: 473, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 555, unknown conditional: 0, unknown unconditional: 555] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-2, t2473={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=-1, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L821] 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}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 793]: 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: 791]: 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 5 procedures, 104 locations, 5 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: 8.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 728 IncrementalHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 26 mSDtfsCounter, 728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=500occurred in iteration=7, InterpolantAutomatonStates: 62, 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, 3.8s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 1158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-28 07:03:58,249 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...