/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/mix056_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:58:16,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:58:16,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:58:16,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:58:16,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:58:16,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:58:16,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:58:16,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:58:16,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:58:16,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:58:16,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:58:16,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:58:16,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:58:16,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:58:16,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:58:16,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:58:16,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:58:16,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:58:16,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:58:16,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:58:16,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:58:16,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:58:16,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:58:16,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:58:16,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:58:16,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:58:16,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:58:16,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:58:16,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:58:16,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:58:16,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:58:16,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:58:16,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:58:16,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:58:16,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:58:16,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:58:16,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:58:16,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:58:16,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:58:16,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:58:16,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:58:16,109 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 06:58:16,139 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:58:16,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:58:16,140 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:58:16,140 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:58:16,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:58:16,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:58:16,142 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:58:16,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:58:16,142 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:58:16,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:58:16,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:58:16,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:58:16,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:58:16,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:58:16,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:58:16,143 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:58:16,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:58:16,144 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:58:16,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:58:16,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:58:16,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:58:16,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:58:16,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:58:16,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:58:16,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:58:16,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:58:16,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:58:16,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:58:16,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:58:16,145 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:58:16,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:58:16,146 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 06:58:16,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:58:16,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:58:16,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:58:16,411 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:58:16,412 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:58:16,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 06:58:17,581 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:58:17,835 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:58:17,836 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 06:58:17,852 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394fd8714/2c813038534f40848865c34a82fa0d99/FLAGb51aff142 [2023-01-28 06:58:17,865 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394fd8714/2c813038534f40848865c34a82fa0d99 [2023-01-28 06:58:17,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:58:17,868 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:58:17,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:58:17,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:58:17,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:58:17,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:58:17" (1/1) ... [2023-01-28 06:58:17,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@529504db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:17, skipping insertion in model container [2023-01-28 06:58:17,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:58:17" (1/1) ... [2023-01-28 06:58:17,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:58:17,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:58:18,028 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 06:58:18,223 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:58:18,235 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:58:18,248 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/mix056_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-01-28 06:58:18,283 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:58:18,324 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:58:18,325 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:58:18,331 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:58:18,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18 WrapperNode [2023-01-28 06:58:18,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:58:18,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:58:18,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:58:18,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:58:18,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,394 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-01-28 06:58:18,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:58:18,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:58:18,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:58:18,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:58:18,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,433 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:58:18,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:58:18,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:58:18,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:58:18,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (1/1) ... [2023-01-28 06:58:18,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:58:18,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:58:18,485 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 06:58:18,508 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 06:58:18,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:58:18,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:58:18,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:58:18,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:58:18,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:58:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:58:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:58:18,528 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:58:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:58:18,529 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:58:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:58:18,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:58:18,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:58:18,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:58:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:58:18,531 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 06:58:18,709 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:58:18,715 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:58:19,027 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:58:19,238 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:58:19,238 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:58:19,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:58:19 BoogieIcfgContainer [2023-01-28 06:58:19,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:58:19,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:58:19,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:58:19,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:58:19,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:58:17" (1/3) ... [2023-01-28 06:58:19,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2ad7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:58:19, skipping insertion in model container [2023-01-28 06:58:19,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:58:18" (2/3) ... [2023-01-28 06:58:19,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2ad7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:58:19, skipping insertion in model container [2023-01-28 06:58:19,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:58:19" (3/3) ... [2023-01-28 06:58:19,264 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-01-28 06:58:19,286 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:58:19,286 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:58:19,286 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:58:19,379 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:58:19,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-01-28 06:58:19,474 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-28 06:58:19,474 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:19,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-28 06:58:19,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-01-28 06:58:19,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-01-28 06:58:19,494 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:58:19,512 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-28 06:58:19,518 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-28 06:58:19,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-01-28 06:58:19,551 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-28 06:58:19,551 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:19,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-01-28 06:58:19,554 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-01-28 06:58:22,490 INFO L134 LiptonReduction]: Checked pairs total: 5011 [2023-01-28 06:58:22,490 INFO L136 LiptonReduction]: Total number of compositions: 89 [2023-01-28 06:58:22,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:58:22,508 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;@2238cf73, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:58:22,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 06:58:22,510 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-01-28 06:58:22,510 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:58:22,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:22,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-01-28 06:58:22,511 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:22,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash 464885, now seen corresponding path program 1 times [2023-01-28 06:58:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:22,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36710079] [2023-01-28 06:58:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:22,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:22,873 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 06:58:22,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:22,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36710079] [2023-01-28 06:58:22,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36710079] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:22,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:22,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:58:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675685774] [2023-01-28 06:58:22,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:22,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:58:22,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:22,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:58:22,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:58:22,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 196 [2023-01-28 06:58:22,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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 06:58:22,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:22,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 196 [2023-01-28 06:58:22,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:23,282 INFO L130 PetriNetUnfolder]: 1263/2016 cut-off events. [2023-01-28 06:58:23,283 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-28 06:58:23,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3927 conditions, 2016 events. 1263/2016 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10920 event pairs, 204 based on Foata normal form. 80/1935 useless extension candidates. Maximal degree in co-relation 3916. Up to 1510 conditions per place. [2023-01-28 06:58:23,295 INFO L137 encePairwiseOnDemand]: 192/196 looper letters, 33 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2023-01-28 06:58:23,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 175 flow [2023-01-28 06:58:23,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:58:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:58:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-01-28 06:58:23,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5459183673469388 [2023-01-28 06:58:23,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-01-28 06:58:23,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-01-28 06:58:23,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:23,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-01-28 06:58:23,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 06:58:23,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:23,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:23,320 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 321 transitions. [2023-01-28 06:58:23,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 175 flow [2023-01-28 06:58:23,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 06:58:23,324 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-01-28 06:58:23,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-01-28 06:58:23,329 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-01-28 06:58:23,329 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-01-28 06:58:23,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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 06:58:23,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:23,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:23,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:58:23,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:23,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash 682702742, now seen corresponding path program 1 times [2023-01-28 06:58:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192394221] [2023-01-28 06:58:23,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:23,707 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 06:58:23,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:23,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192394221] [2023-01-28 06:58:23,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192394221] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:23,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:23,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:58:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138811398] [2023-01-28 06:58:23,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:23,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:58:23,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:23,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:58:23,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:58:23,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 196 [2023-01-28 06:58:23,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 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 06:58:23,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:23,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 196 [2023-01-28 06:58:23,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:24,243 INFO L130 PetriNetUnfolder]: 2646/3975 cut-off events. [2023-01-28 06:58:24,243 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2023-01-28 06:58:24,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8254 conditions, 3975 events. 2646/3975 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 20376 event pairs, 793 based on Foata normal form. 212/4187 useless extension candidates. Maximal degree in co-relation 8244. Up to 1747 conditions per place. [2023-01-28 06:58:24,263 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 33 selfloop transitions, 6 changer transitions 25/64 dead transitions. [2023-01-28 06:58:24,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 64 transitions, 274 flow [2023-01-28 06:58:24,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:58:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:58:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2023-01-28 06:58:24,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-01-28 06:58:24,269 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 476 transitions. [2023-01-28 06:58:24,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 476 transitions. [2023-01-28 06:58:24,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:24,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 476 transitions. [2023-01-28 06:58:24,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 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 06:58:24,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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 06:58:24,275 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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 06:58:24,275 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 476 transitions. [2023-01-28 06:58:24,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 64 transitions, 274 flow [2023-01-28 06:58:24,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:24,277 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 110 flow [2023-01-28 06:58:24,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-01-28 06:58:24,278 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-01-28 06:58:24,278 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 110 flow [2023-01-28 06:58:24,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 0 states have call successors, (0), 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 06:58:24,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:24,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:24,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:58:24,279 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:24,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash -311073050, now seen corresponding path program 1 times [2023-01-28 06:58:24,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:24,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969727635] [2023-01-28 06:58:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:24,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:24,465 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 06:58:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969727635] [2023-01-28 06:58:24,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969727635] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:24,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:24,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:58:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498557513] [2023-01-28 06:58:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:24,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:24,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:24,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 196 [2023-01-28 06:58:24,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 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 06:58:24,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:24,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 196 [2023-01-28 06:58:24,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:24,974 INFO L130 PetriNetUnfolder]: 2387/3633 cut-off events. [2023-01-28 06:58:24,975 INFO L131 PetriNetUnfolder]: For 2776/2776 co-relation queries the response was YES. [2023-01-28 06:58:24,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9853 conditions, 3633 events. 2387/3633 cut-off events. For 2776/2776 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18534 event pairs, 221 based on Foata normal form. 175/3808 useless extension candidates. Maximal degree in co-relation 9839. Up to 1625 conditions per place. [2023-01-28 06:58:24,998 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 40 selfloop transitions, 10 changer transitions 30/80 dead transitions. [2023-01-28 06:58:24,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 80 transitions, 456 flow [2023-01-28 06:58:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:58:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:58:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 652 transitions. [2023-01-28 06:58:25,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4752186588921283 [2023-01-28 06:58:25,000 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 652 transitions. [2023-01-28 06:58:25,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 652 transitions. [2023-01-28 06:58:25,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:25,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 652 transitions. [2023-01-28 06:58:25,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:25,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 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 06:58:25,005 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 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 06:58:25,005 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 110 flow. Second operand 7 states and 652 transitions. [2023-01-28 06:58:25,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 80 transitions, 456 flow [2023-01-28 06:58:25,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 80 transitions, 418 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:25,019 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 176 flow [2023-01-28 06:58:25,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-01-28 06:58:25,020 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2023-01-28 06:58:25,023 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 176 flow [2023-01-28 06:58:25,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 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 06:58:25,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:25,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:25,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:58:25,024 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:25,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -311077855, now seen corresponding path program 1 times [2023-01-28 06:58:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:25,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694804048] [2023-01-28 06:58:25,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:25,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:25,253 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 06:58:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694804048] [2023-01-28 06:58:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694804048] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:25,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:25,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:58:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39391016] [2023-01-28 06:58:25,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:25,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:25,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:25,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:25,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 196 [2023-01-28 06:58:25,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 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 06:58:25,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:25,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 196 [2023-01-28 06:58:25,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:25,771 INFO L130 PetriNetUnfolder]: 2285/3482 cut-off events. [2023-01-28 06:58:25,772 INFO L131 PetriNetUnfolder]: For 7909/7909 co-relation queries the response was YES. [2023-01-28 06:58:25,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10643 conditions, 3482 events. 2285/3482 cut-off events. For 7909/7909 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 17625 event pairs, 346 based on Foata normal form. 166/3648 useless extension candidates. Maximal degree in co-relation 10623. Up to 1551 conditions per place. [2023-01-28 06:58:25,792 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 45 selfloop transitions, 14 changer transitions 29/88 dead transitions. [2023-01-28 06:58:25,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 88 transitions, 570 flow [2023-01-28 06:58:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:58:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:58:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2023-01-28 06:58:25,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47959183673469385 [2023-01-28 06:58:25,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2023-01-28 06:58:25,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2023-01-28 06:58:25,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:25,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2023-01-28 06:58:25,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:25,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 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 06:58:25,805 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 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 06:58:25,805 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 176 flow. Second operand 7 states and 658 transitions. [2023-01-28 06:58:25,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 88 transitions, 570 flow [2023-01-28 06:58:25,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 88 transitions, 554 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-28 06:58:25,825 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 262 flow [2023-01-28 06:58:25,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-01-28 06:58:25,856 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-01-28 06:58:25,856 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 262 flow [2023-01-28 06:58:25,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 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 06:58:25,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:25,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:25,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:58:25,857 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:25,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1053356335, now seen corresponding path program 1 times [2023-01-28 06:58:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254899515] [2023-01-28 06:58:25,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:26,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 06:58:26,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:26,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254899515] [2023-01-28 06:58:26,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254899515] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:26,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:26,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:58:26,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493282410] [2023-01-28 06:58:26,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:26,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:58:26,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:26,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:58:26,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:58:26,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 196 [2023-01-28 06:58:26,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 06:58:26,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:26,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 196 [2023-01-28 06:58:26,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:26,300 INFO L130 PetriNetUnfolder]: 822/1426 cut-off events. [2023-01-28 06:58:26,300 INFO L131 PetriNetUnfolder]: For 2932/2990 co-relation queries the response was YES. [2023-01-28 06:58:26,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4550 conditions, 1426 events. 822/1426 cut-off events. For 2932/2990 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7250 event pairs, 191 based on Foata normal form. 115/1536 useless extension candidates. Maximal degree in co-relation 4525. Up to 1146 conditions per place. [2023-01-28 06:58:26,312 INFO L137 encePairwiseOnDemand]: 191/196 looper letters, 44 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2023-01-28 06:58:26,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 470 flow [2023-01-28 06:58:26,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:58:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:58:26,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-01-28 06:58:26,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136054421768708 [2023-01-28 06:58:26,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-01-28 06:58:26,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-01-28 06:58:26,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:26,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-01-28 06:58:26,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 06:58:26,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:26,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:58:26,318 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 262 flow. Second operand 3 states and 302 transitions. [2023-01-28 06:58:26,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 470 flow [2023-01-28 06:58:26,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 454 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-01-28 06:58:26,327 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 274 flow [2023-01-28 06:58:26,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-01-28 06:58:26,329 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-01-28 06:58:26,329 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 274 flow [2023-01-28 06:58:26,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 06:58:26,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:26,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:26,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:58:26,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:26,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:26,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1259387927, now seen corresponding path program 1 times [2023-01-28 06:58:26,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:26,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125858893] [2023-01-28 06:58:26,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:26,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:26,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 06:58:26,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:26,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125858893] [2023-01-28 06:58:26,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125858893] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:26,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:26,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:58:26,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833680262] [2023-01-28 06:58:26,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:26,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:26,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:26,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:26,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:26,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 196 [2023-01-28 06:58:26,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 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 06:58:26,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:26,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 196 [2023-01-28 06:58:26,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:26,973 INFO L130 PetriNetUnfolder]: 1446/2457 cut-off events. [2023-01-28 06:58:26,973 INFO L131 PetriNetUnfolder]: For 4848/4848 co-relation queries the response was YES. [2023-01-28 06:58:26,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8482 conditions, 2457 events. 1446/2457 cut-off events. For 4848/4848 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13507 event pairs, 315 based on Foata normal form. 87/2544 useless extension candidates. Maximal degree in co-relation 8458. Up to 973 conditions per place. [2023-01-28 06:58:26,986 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 55 selfloop transitions, 14 changer transitions 32/101 dead transitions. [2023-01-28 06:58:26,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 101 transitions, 751 flow [2023-01-28 06:58:26,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:58:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:58:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 657 transitions. [2023-01-28 06:58:26,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47886297376093295 [2023-01-28 06:58:26,989 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 657 transitions. [2023-01-28 06:58:26,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 657 transitions. [2023-01-28 06:58:26,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:26,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 657 transitions. [2023-01-28 06:58:26,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 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 06:58:26,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 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 06:58:26,993 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 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 06:58:26,993 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 274 flow. Second operand 7 states and 657 transitions. [2023-01-28 06:58:26,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 101 transitions, 751 flow [2023-01-28 06:58:27,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 101 transitions, 739 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 06:58:27,002 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 318 flow [2023-01-28 06:58:27,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2023-01-28 06:58:27,002 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2023-01-28 06:58:27,003 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 318 flow [2023-01-28 06:58:27,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 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 06:58:27,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:27,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:27,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:58:27,003 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:27,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash 207113669, now seen corresponding path program 1 times [2023-01-28 06:58:27,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:27,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804846495] [2023-01-28 06:58:27,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:27,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:27,156 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 06:58:27,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:27,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804846495] [2023-01-28 06:58:27,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804846495] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:27,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:27,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:58:27,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965348795] [2023-01-28 06:58:27,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:27,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:58:27,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:27,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:58:27,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:58:27,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 196 [2023-01-28 06:58:27,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 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 06:58:27,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:27,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 196 [2023-01-28 06:58:27,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:27,320 INFO L130 PetriNetUnfolder]: 453/890 cut-off events. [2023-01-28 06:58:27,320 INFO L131 PetriNetUnfolder]: For 1920/1944 co-relation queries the response was YES. [2023-01-28 06:58:27,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3138 conditions, 890 events. 453/890 cut-off events. For 1920/1944 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4652 event pairs, 120 based on Foata normal form. 119/1000 useless extension candidates. Maximal degree in co-relation 3108. Up to 311 conditions per place. [2023-01-28 06:58:27,325 INFO L137 encePairwiseOnDemand]: 191/196 looper letters, 57 selfloop transitions, 7 changer transitions 1/72 dead transitions. [2023-01-28 06:58:27,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 682 flow [2023-01-28 06:58:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 06:58:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 06:58:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 403 transitions. [2023-01-28 06:58:27,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.514030612244898 [2023-01-28 06:58:27,327 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 403 transitions. [2023-01-28 06:58:27,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 403 transitions. [2023-01-28 06:58:27,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:27,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 403 transitions. [2023-01-28 06:58:27,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 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 06:58:27,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 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 06:58:27,330 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 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 06:58:27,330 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 318 flow. Second operand 4 states and 403 transitions. [2023-01-28 06:58:27,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 682 flow [2023-01-28 06:58:27,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 643 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-01-28 06:58:27,336 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 333 flow [2023-01-28 06:58:27,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-01-28 06:58:27,337 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2023-01-28 06:58:27,337 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 333 flow [2023-01-28 06:58:27,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 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 06:58:27,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:27,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:27,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:58:27,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:27,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1666297553, now seen corresponding path program 1 times [2023-01-28 06:58:27,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999943161] [2023-01-28 06:58:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:27,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:27,563 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 06:58:27,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999943161] [2023-01-28 06:58:27,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999943161] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:27,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:27,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:58:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433102520] [2023-01-28 06:58:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:27,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:58:27,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:27,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:58:27,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:58:27,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 196 [2023-01-28 06:58:27,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 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 06:58:27,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:27,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 196 [2023-01-28 06:58:27,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:27,706 INFO L130 PetriNetUnfolder]: 369/704 cut-off events. [2023-01-28 06:58:27,706 INFO L131 PetriNetUnfolder]: For 1660/1675 co-relation queries the response was YES. [2023-01-28 06:58:27,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 704 events. 369/704 cut-off events. For 1660/1675 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3557 event pairs, 106 based on Foata normal form. 50/745 useless extension candidates. Maximal degree in co-relation 2739. Up to 285 conditions per place. [2023-01-28 06:58:27,710 INFO L137 encePairwiseOnDemand]: 191/196 looper letters, 45 selfloop transitions, 10 changer transitions 13/72 dead transitions. [2023-01-28 06:58:27,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 671 flow [2023-01-28 06:58:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:58:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:58:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-01-28 06:58:27,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020408163265306 [2023-01-28 06:58:27,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-01-28 06:58:27,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-01-28 06:58:27,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:27,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-01-28 06:58:27,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 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 06:58:27,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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 06:58:27,715 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 196.0) internal successors, (1176), 6 states have internal predecessors, (1176), 0 states have call successors, (0), 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 06:58:27,715 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 333 flow. Second operand 5 states and 492 transitions. [2023-01-28 06:58:27,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 671 flow [2023-01-28 06:58:27,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 641 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-28 06:58:27,720 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 277 flow [2023-01-28 06:58:27,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2023-01-28 06:58:27,721 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2023-01-28 06:58:27,721 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 277 flow [2023-01-28 06:58:27,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 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 06:58:27,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:27,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:27,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:58:27,722 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:27,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:27,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1851954665, now seen corresponding path program 1 times [2023-01-28 06:58:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:27,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497220069] [2023-01-28 06:58:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:58:28,515 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 06:58:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:58:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497220069] [2023-01-28 06:58:28,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497220069] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:58:28,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:58:28,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:58:28,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023393630] [2023-01-28 06:58:28,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:58:28,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:58:28,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:58:28,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:58:28,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:58:28,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 196 [2023-01-28 06:58:28,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 277 flow. Second operand has 8 states, 8 states have (on average 77.75) internal successors, (622), 8 states have internal predecessors, (622), 0 states have call successors, (0), 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 06:58:28,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:58:28,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 196 [2023-01-28 06:58:28,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:58:28,848 INFO L130 PetriNetUnfolder]: 296/562 cut-off events. [2023-01-28 06:58:28,848 INFO L131 PetriNetUnfolder]: For 1765/1765 co-relation queries the response was YES. [2023-01-28 06:58:28,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 562 events. 296/562 cut-off events. For 1765/1765 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2457 event pairs, 19 based on Foata normal form. 1/563 useless extension candidates. Maximal degree in co-relation 2357. Up to 158 conditions per place. [2023-01-28 06:58:28,851 INFO L137 encePairwiseOnDemand]: 184/196 looper letters, 34 selfloop transitions, 14 changer transitions 71/119 dead transitions. [2023-01-28 06:58:28,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 119 transitions, 1071 flow [2023-01-28 06:58:28,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 06:58:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 06:58:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 838 transitions. [2023-01-28 06:58:28,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275510204081633 [2023-01-28 06:58:28,853 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 838 transitions. [2023-01-28 06:58:28,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 838 transitions. [2023-01-28 06:58:28,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:58:28,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 838 transitions. [2023-01-28 06:58:28,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 83.8) internal successors, (838), 10 states have internal predecessors, (838), 0 states have call successors, (0), 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 06:58:28,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 0 states have call successors, (0), 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 06:58:28,859 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 0 states have call successors, (0), 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 06:58:28,859 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 277 flow. Second operand 10 states and 838 transitions. [2023-01-28 06:58:28,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 119 transitions, 1071 flow [2023-01-28 06:58:28,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 119 transitions, 869 flow, removed 28 selfloop flow, removed 11 redundant places. [2023-01-28 06:58:28,865 INFO L231 Difference]: Finished difference. Result has 60 places, 38 transitions, 285 flow [2023-01-28 06:58:28,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=285, PETRI_PLACES=60, PETRI_TRANSITIONS=38} [2023-01-28 06:58:28,866 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2023-01-28 06:58:28,866 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 285 flow [2023-01-28 06:58:28,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 77.75) internal successors, (622), 8 states have internal predecessors, (622), 0 states have call successors, (0), 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 06:58:28,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:58:28,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:28,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:58:28,867 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-28 06:58:28,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:58:28,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2043530527, now seen corresponding path program 2 times [2023-01-28 06:58:28,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:58:28,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118195688] [2023-01-28 06:58:28,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:58:28,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:58:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:58:28,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:58:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:58:28,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:58:28,976 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:58:28,977 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-28 06:58:28,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-28 06:58:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-28 06:58:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-28 06:58:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-28 06:58:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-28 06:58:28,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:58:28,979 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:58:28,984 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:58:28,984 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:58:29,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:58:29 BasicIcfg [2023-01-28 06:58:29,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:58:29,031 INFO L158 Benchmark]: Toolchain (without parser) took 11163.06ms. Allocated memory was 377.5MB in the beginning and 545.3MB in the end (delta: 167.8MB). Free memory was 335.0MB in the beginning and 357.2MB in the end (delta: -22.2MB). Peak memory consumption was 147.7MB. Max. memory is 16.0GB. [2023-01-28 06:58:29,031 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:58:29,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.44ms. Allocated memory is still 377.5MB. Free memory was 335.0MB in the beginning and 311.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 06:58:29,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.39ms. Allocated memory is still 377.5MB. Free memory was 311.6MB in the beginning and 309.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:58:29,032 INFO L158 Benchmark]: Boogie Preprocessor took 56.63ms. Allocated memory is still 377.5MB. Free memory was 309.1MB in the beginning and 307.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:58:29,032 INFO L158 Benchmark]: RCFGBuilder took 788.28ms. Allocated memory is still 377.5MB. Free memory was 307.4MB in the beginning and 342.3MB in the end (delta: -34.9MB). Peak memory consumption was 33.8MB. Max. memory is 16.0GB. [2023-01-28 06:58:29,032 INFO L158 Benchmark]: TraceAbstraction took 9788.27ms. Allocated memory was 377.5MB in the beginning and 545.3MB in the end (delta: 167.8MB). Free memory was 341.4MB in the beginning and 357.2MB in the end (delta: -15.7MB). Peak memory consumption was 151.7MB. Max. memory is 16.0GB. [2023-01-28 06:58:29,033 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.12ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 463.44ms. Allocated memory is still 377.5MB. Free memory was 335.0MB in the beginning and 311.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.39ms. Allocated memory is still 377.5MB. Free memory was 311.6MB in the beginning and 309.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 56.63ms. Allocated memory is still 377.5MB. Free memory was 309.1MB in the beginning and 307.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 788.28ms. Allocated memory is still 377.5MB. Free memory was 307.4MB in the beginning and 342.3MB in the end (delta: -34.9MB). Peak memory consumption was 33.8MB. Max. memory is 16.0GB. * TraceAbstraction took 9788.27ms. Allocated memory was 377.5MB in the beginning and 545.3MB in the end (delta: 167.8MB). Free memory was 341.4MB in the beginning and 357.2MB in the end (delta: -15.7MB). Peak memory consumption was 151.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 112 PlacesBefore, 35 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 5011 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2105, independent: 1940, independent conditional: 0, independent unconditional: 1940, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1022, independent: 988, independent conditional: 0, independent unconditional: 988, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2105, independent: 952, independent conditional: 0, independent unconditional: 952, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 1022, unknown conditional: 0, unknown unconditional: 1022] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1489, ((void *)0), P0, ((void *)0))=-1, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1490, ((void *)0), P1, ((void *)0))=0, t1489={5:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1491, ((void *)0), P2, ((void *)0))=1, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L790] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: 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: 832]: 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 7 procedures, 134 locations, 6 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: 9.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 283 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 920 IncrementalHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 25 mSDtfsCounter, 920 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 674 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 06:58:29,053 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...