/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:07:42,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:07:42,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:07:42,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:07:42,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:07:42,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:07:42,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:07:42,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:07:42,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:07:42,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:07:42,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:07:42,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:07:42,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:07:42,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:07:42,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:07:42,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:07:42,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:07:42,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:07:42,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:07:42,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:07:42,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:07:42,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:07:42,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:07:42,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:07:42,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:07:42,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:07:42,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:07:42,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:07:42,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:07:42,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:07:42,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:07:42,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:07:42,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:07:42,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:07:42,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:07:42,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:07:42,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:07:42,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:07:42,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:07:42,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:07:42,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:07:42,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:07:42,089 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:07:42,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:07:42,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:07:42,090 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:07:42,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:07:42,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:07:42,091 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:07:42,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:07:42,091 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:07:42,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:07:42,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:07:42,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:07:42,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:07:42,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:07:42,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:07:42,092 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:07:42,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:07:42,092 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:07:42,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:07:42,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:07:42,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:07:42,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:07:42,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:07:42,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:07:42,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:07:42,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:07:42,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:07:42,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:07:42,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:07:42,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:07:42,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:07:42,094 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 18:07:42,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:07:42,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:07:42,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:07:42,305 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:07:42,306 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:07:42,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-01-27 18:07:43,517 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:07:43,770 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:07:43,771 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-01-27 18:07:43,783 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055512b62/8635f300714d4e1abe7df31bcc878e1d/FLAG209c80503 [2023-01-27 18:07:43,795 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055512b62/8635f300714d4e1abe7df31bcc878e1d [2023-01-27 18:07:43,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:07:43,798 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:07:43,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:07:43,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:07:43,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:07:43,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:07:43" (1/1) ... [2023-01-27 18:07:43,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a9f9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:43, skipping insertion in model container [2023-01-27 18:07:43,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:07:43" (1/1) ... [2023-01-27 18:07:43,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:07:43,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:07:44,015 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2023-01-27 18:07:44,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:07:44,212 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:07:44,222 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2023-01-27 18:07:44,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:07:44,302 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:07:44,303 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:07:44,308 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:07:44,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44 WrapperNode [2023-01-27 18:07:44,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:07:44,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:07:44,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:07:44,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:07:44,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,361 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-01-27 18:07:44,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:07:44,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:07:44,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:07:44,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:07:44,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,388 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:07:44,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:07:44,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:07:44,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:07:44,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (1/1) ... [2023-01-27 18:07:44,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:07:44,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:07:44,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 18:07:44,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 18:07:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:07:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:07:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:07:44,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:07:44,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:07:44,467 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:07:44,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:07:44,467 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:07:44,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:07:44,467 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:07:44,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:07:44,468 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:07:44,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:07:44,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:07:44,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:07:44,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:07:44,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:07:44,469 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:07:44,613 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:07:44,615 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:07:44,890 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:07:45,010 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:07:45,011 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:07:45,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:07:45 BoogieIcfgContainer [2023-01-27 18:07:45,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:07:45,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:07:45,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:07:45,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:07:45,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:07:43" (1/3) ... [2023-01-27 18:07:45,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb01d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:07:45, skipping insertion in model container [2023-01-27 18:07:45,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:07:44" (2/3) ... [2023-01-27 18:07:45,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb01d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:07:45, skipping insertion in model container [2023-01-27 18:07:45,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:07:45" (3/3) ... [2023-01-27 18:07:45,020 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2023-01-27 18:07:45,035 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:07:45,035 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:07:45,035 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:07:45,133 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:07:45,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-01-27 18:07:45,242 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-01-27 18:07:45,242 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:07:45,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-01-27 18:07:45,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-01-27 18:07:45,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-01-27 18:07:45,259 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:07:45,278 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-01-27 18:07:45,282 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-01-27 18:07:45,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-01-27 18:07:45,323 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-01-27 18:07:45,323 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:07:45,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-01-27 18:07:45,327 INFO L119 LiptonReduction]: Number of co-enabled transitions 2718 [2023-01-27 18:07:49,149 INFO L134 LiptonReduction]: Checked pairs total: 6245 [2023-01-27 18:07:49,150 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-01-27 18:07:49,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:07:49,169 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;@67e16409, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:07:49,169 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:07:49,173 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-01-27 18:07:49,174 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:07:49,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:49,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:49,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:49,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:49,179 INFO L85 PathProgramCache]: Analyzing trace with hash 316636311, now seen corresponding path program 1 times [2023-01-27 18:07:49,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:49,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627742962] [2023-01-27 18:07:49,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:49,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:49,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:49,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627742962] [2023-01-27 18:07:49,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627742962] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:49,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:49,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:07:49,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104028195] [2023-01-27 18:07:49,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:49,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:07:49,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:49,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:07:49,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:07:49,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 237 [2023-01-27 18:07:49,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:49,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:49,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 237 [2023-01-27 18:07:49,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:50,236 INFO L130 PetriNetUnfolder]: 2594/3775 cut-off events. [2023-01-27 18:07:50,236 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-01-27 18:07:50,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7470 conditions, 3775 events. 2594/3775 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19440 event pairs, 518 based on Foata normal form. 0/3591 useless extension candidates. Maximal degree in co-relation 7458. Up to 2797 conditions per place. [2023-01-27 18:07:50,263 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-01-27 18:07:50,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 154 flow [2023-01-27 18:07:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:07:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:07:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-01-27 18:07:50,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372714486638537 [2023-01-27 18:07:50,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-01-27 18:07:50,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-01-27 18:07:50,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:50,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-01-27 18:07:50,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:50,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:50,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:50,291 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 382 transitions. [2023-01-27 18:07:50,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 154 flow [2023-01-27 18:07:50,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:07:50,298 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-01-27 18:07:50,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-01-27 18:07:50,303 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-01-27 18:07:50,303 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-01-27 18:07:50,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:50,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:50,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:50,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:07:50,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:50,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:50,313 INFO L85 PathProgramCache]: Analyzing trace with hash -655096605, now seen corresponding path program 1 times [2023-01-27 18:07:50,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:50,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744727217] [2023-01-27 18:07:50,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:50,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:50,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:50,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744727217] [2023-01-27 18:07:50,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744727217] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:50,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:50,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:07:50,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365665281] [2023-01-27 18:07:50,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:50,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:07:50,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:50,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:07:50,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:07:50,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 237 [2023-01-27 18:07:50,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:50,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:50,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 237 [2023-01-27 18:07:50,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:51,408 INFO L130 PetriNetUnfolder]: 4631/6320 cut-off events. [2023-01-27 18:07:51,408 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2023-01-27 18:07:51,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13062 conditions, 6320 events. 4631/6320 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 27267 event pairs, 1783 based on Foata normal form. 16/6336 useless extension candidates. Maximal degree in co-relation 13052. Up to 6129 conditions per place. [2023-01-27 18:07:51,455 INFO L137 encePairwiseOnDemand]: 231/237 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2023-01-27 18:07:51,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 184 flow [2023-01-27 18:07:51,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:07:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:07:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-01-27 18:07:51,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510548523206751 [2023-01-27 18:07:51,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-01-27 18:07:51,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-01-27 18:07:51,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:51,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-01-27 18:07:51,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:51,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:51,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:51,461 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 363 transitions. [2023-01-27 18:07:51,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 184 flow [2023-01-27 18:07:51,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:07:51,464 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 91 flow [2023-01-27 18:07:51,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-01-27 18:07:51,465 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-01-27 18:07:51,465 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 91 flow [2023-01-27 18:07:51,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:51,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:51,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:51,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:07:51,466 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:51,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2045359559, now seen corresponding path program 1 times [2023-01-27 18:07:51,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:51,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455444096] [2023-01-27 18:07:51,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:51,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:51,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:51,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455444096] [2023-01-27 18:07:51,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455444096] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:51,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:51,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:07:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143332340] [2023-01-27 18:07:51,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:51,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:07:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:51,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:07:51,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:07:51,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 237 [2023-01-27 18:07:51,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:51,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:51,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 237 [2023-01-27 18:07:51,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:52,084 INFO L130 PetriNetUnfolder]: 2864/4218 cut-off events. [2023-01-27 18:07:52,084 INFO L131 PetriNetUnfolder]: For 444/444 co-relation queries the response was YES. [2023-01-27 18:07:52,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9182 conditions, 4218 events. 2864/4218 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 21214 event pairs, 1071 based on Foata normal form. 100/4213 useless extension candidates. Maximal degree in co-relation 9171. Up to 2547 conditions per place. [2023-01-27 18:07:52,119 INFO L137 encePairwiseOnDemand]: 234/237 looper letters, 30 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2023-01-27 18:07:52,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 177 flow [2023-01-27 18:07:52,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:07:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:07:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-01-27 18:07:52,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260196905766527 [2023-01-27 18:07:52,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-01-27 18:07:52,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-01-27 18:07:52,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:52,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-01-27 18:07:52,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:52,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:52,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:52,125 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 91 flow. Second operand 3 states and 374 transitions. [2023-01-27 18:07:52,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 177 flow [2023-01-27 18:07:52,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:07:52,129 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 97 flow [2023-01-27 18:07:52,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-01-27 18:07:52,130 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-01-27 18:07:52,130 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 97 flow [2023-01-27 18:07:52,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:52,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:52,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:52,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:07:52,131 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:52,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1810101240, now seen corresponding path program 1 times [2023-01-27 18:07:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79471994] [2023-01-27 18:07:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:52,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:52,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79471994] [2023-01-27 18:07:52,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79471994] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:52,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:52,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:07:52,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289268344] [2023-01-27 18:07:52,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:52,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:07:52,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:52,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:07:52,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:07:52,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-01-27 18:07:52,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:52,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:52,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-01-27 18:07:52,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:52,984 INFO L130 PetriNetUnfolder]: 2650/3955 cut-off events. [2023-01-27 18:07:52,984 INFO L131 PetriNetUnfolder]: For 1112/1112 co-relation queries the response was YES. [2023-01-27 18:07:52,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9289 conditions, 3955 events. 2650/3955 cut-off events. For 1112/1112 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20664 event pairs, 521 based on Foata normal form. 296/4143 useless extension candidates. Maximal degree in co-relation 9276. Up to 2616 conditions per place. [2023-01-27 18:07:53,015 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 55 selfloop transitions, 9 changer transitions 2/71 dead transitions. [2023-01-27 18:07:53,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 71 transitions, 347 flow [2023-01-27 18:07:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:07:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:07:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-01-27 18:07:53,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012658227848101 [2023-01-27 18:07:53,018 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-01-27 18:07:53,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-01-27 18:07:53,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:53,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-01-27 18:07:53,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,023 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,023 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 97 flow. Second operand 5 states and 594 transitions. [2023-01-27 18:07:53,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 71 transitions, 347 flow [2023-01-27 18:07:53,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 71 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:07:53,027 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 160 flow [2023-01-27 18:07:53,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-01-27 18:07:53,028 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-01-27 18:07:53,028 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 160 flow [2023-01-27 18:07:53,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:53,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:53,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:07:53,029 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:53,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1218611985, now seen corresponding path program 1 times [2023-01-27 18:07:53,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:53,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049242509] [2023-01-27 18:07:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:53,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:53,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049242509] [2023-01-27 18:07:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049242509] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:53,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:53,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:07:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470535105] [2023-01-27 18:07:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:53,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:07:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:53,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:07:53,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:07:53,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-01-27 18:07:53,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:53,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-01-27 18:07:53,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:53,754 INFO L130 PetriNetUnfolder]: 2019/3154 cut-off events. [2023-01-27 18:07:53,754 INFO L131 PetriNetUnfolder]: For 1897/1912 co-relation queries the response was YES. [2023-01-27 18:07:53,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9709 conditions, 3154 events. 2019/3154 cut-off events. For 1897/1912 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16996 event pairs, 237 based on Foata normal form. 219/3290 useless extension candidates. Maximal degree in co-relation 9693. Up to 1181 conditions per place. [2023-01-27 18:07:53,774 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 73 selfloop transitions, 17 changer transitions 2/97 dead transitions. [2023-01-27 18:07:53,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 97 transitions, 554 flow [2023-01-27 18:07:53,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:07:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:07:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 832 transitions. [2023-01-27 18:07:53,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015069318866787 [2023-01-27 18:07:53,777 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 832 transitions. [2023-01-27 18:07:53,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 832 transitions. [2023-01-27 18:07:53,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:53,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 832 transitions. [2023-01-27 18:07:53,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,783 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,783 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 160 flow. Second operand 7 states and 832 transitions. [2023-01-27 18:07:53,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 97 transitions, 554 flow [2023-01-27 18:07:53,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 97 transitions, 549 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:07:53,792 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 276 flow [2023-01-27 18:07:53,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-01-27 18:07:53,793 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-01-27 18:07:53,793 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 276 flow [2023-01-27 18:07:53,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:53,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:53,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:53,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:07:53,794 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:53,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:53,794 INFO L85 PathProgramCache]: Analyzing trace with hash 805015443, now seen corresponding path program 1 times [2023-01-27 18:07:53,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:53,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080475982] [2023-01-27 18:07:53,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:53,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:54,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080475982] [2023-01-27 18:07:54,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080475982] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:54,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:54,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:07:54,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405619772] [2023-01-27 18:07:54,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:54,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:07:54,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:54,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:07:54,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:07:54,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-01-27 18:07:54,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 276 flow. Second operand has 8 states, 8 states have (on average 103.375) internal successors, (827), 8 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:54,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:54,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-01-27 18:07:54,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:55,325 INFO L130 PetriNetUnfolder]: 3961/5923 cut-off events. [2023-01-27 18:07:55,325 INFO L131 PetriNetUnfolder]: For 11576/11576 co-relation queries the response was YES. [2023-01-27 18:07:55,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21422 conditions, 5923 events. 3961/5923 cut-off events. For 11576/11576 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 30822 event pairs, 372 based on Foata normal form. 39/5962 useless extension candidates. Maximal degree in co-relation 21402. Up to 3569 conditions per place. [2023-01-27 18:07:55,359 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 74 selfloop transitions, 22 changer transitions 103/199 dead transitions. [2023-01-27 18:07:55,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 199 transitions, 1570 flow [2023-01-27 18:07:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-27 18:07:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-27 18:07:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1349 transitions. [2023-01-27 18:07:55,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47433192686357245 [2023-01-27 18:07:55,363 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1349 transitions. [2023-01-27 18:07:55,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1349 transitions. [2023-01-27 18:07:55,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:55,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1349 transitions. [2023-01-27 18:07:55,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 112.41666666666667) internal successors, (1349), 12 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 237.0) internal successors, (3081), 13 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,371 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 237.0) internal successors, (3081), 13 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,371 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 276 flow. Second operand 12 states and 1349 transitions. [2023-01-27 18:07:55,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 199 transitions, 1570 flow [2023-01-27 18:07:55,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 199 transitions, 1366 flow, removed 66 selfloop flow, removed 3 redundant places. [2023-01-27 18:07:55,494 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 334 flow [2023-01-27 18:07:55,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=334, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-01-27 18:07:55,495 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2023-01-27 18:07:55,495 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 334 flow [2023-01-27 18:07:55,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.375) internal successors, (827), 8 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:55,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:55,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:07:55,496 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:55,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1608402165, now seen corresponding path program 2 times [2023-01-27 18:07:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:55,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811936552] [2023-01-27 18:07:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:55,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811936552] [2023-01-27 18:07:55,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811936552] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:55,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:55,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:07:55,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140140940] [2023-01-27 18:07:55,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:55,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:07:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:07:55,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:07:55,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-01-27 18:07:55,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:55,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:55,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-01-27 18:07:55,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:56,017 INFO L130 PetriNetUnfolder]: 978/1590 cut-off events. [2023-01-27 18:07:56,017 INFO L131 PetriNetUnfolder]: For 3161/3201 co-relation queries the response was YES. [2023-01-27 18:07:56,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5710 conditions, 1590 events. 978/1590 cut-off events. For 3161/3201 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7594 event pairs, 154 based on Foata normal form. 117/1679 useless extension candidates. Maximal degree in co-relation 5685. Up to 536 conditions per place. [2023-01-27 18:07:56,027 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 91 selfloop transitions, 17 changer transitions 16/130 dead transitions. [2023-01-27 18:07:56,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 130 transitions, 999 flow [2023-01-27 18:07:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:07:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:07:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2023-01-27 18:07:56,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027124773960217 [2023-01-27 18:07:56,031 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2023-01-27 18:07:56,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2023-01-27 18:07:56,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:56,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2023-01-27 18:07:56,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,036 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,036 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 334 flow. Second operand 7 states and 834 transitions. [2023-01-27 18:07:56,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 130 transitions, 999 flow [2023-01-27 18:07:56,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 130 transitions, 929 flow, removed 30 selfloop flow, removed 6 redundant places. [2023-01-27 18:07:56,045 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 404 flow [2023-01-27 18:07:56,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2023-01-27 18:07:56,046 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-01-27 18:07:56,046 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 404 flow [2023-01-27 18:07:56,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:56,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:56,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:07:56,047 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:56,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash -944871372, now seen corresponding path program 1 times [2023-01-27 18:07:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:56,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537825379] [2023-01-27 18:07:56,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:56,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:56,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537825379] [2023-01-27 18:07:56,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537825379] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:56,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:56,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:07:56,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558607824] [2023-01-27 18:07:56,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:56,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:07:56,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:56,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:07:56,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:07:56,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-01-27 18:07:56,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:56,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-01-27 18:07:56,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:56,686 INFO L130 PetriNetUnfolder]: 1783/2772 cut-off events. [2023-01-27 18:07:56,687 INFO L131 PetriNetUnfolder]: For 6409/6409 co-relation queries the response was YES. [2023-01-27 18:07:56,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11034 conditions, 2772 events. 1783/2772 cut-off events. For 6409/6409 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 13112 event pairs, 160 based on Foata normal form. 10/2782 useless extension candidates. Maximal degree in co-relation 11010. Up to 1663 conditions per place. [2023-01-27 18:07:56,702 INFO L137 encePairwiseOnDemand]: 229/237 looper letters, 103 selfloop transitions, 25 changer transitions 14/142 dead transitions. [2023-01-27 18:07:56,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 142 transitions, 1250 flow [2023-01-27 18:07:56,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:07:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:07:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2023-01-27 18:07:56,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037974683544304 [2023-01-27 18:07:56,704 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 597 transitions. [2023-01-27 18:07:56,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 597 transitions. [2023-01-27 18:07:56,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:56,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 597 transitions. [2023-01-27 18:07:56,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,708 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,708 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 404 flow. Second operand 5 states and 597 transitions. [2023-01-27 18:07:56,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 142 transitions, 1250 flow [2023-01-27 18:07:56,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 1090 flow, removed 63 selfloop flow, removed 2 redundant places. [2023-01-27 18:07:56,740 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 533 flow [2023-01-27 18:07:56,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=533, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2023-01-27 18:07:56,742 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2023-01-27 18:07:56,743 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 533 flow [2023-01-27 18:07:56,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:56,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:56,743 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-27 18:07:56,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:07:56,743 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:56,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:56,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2101778384, now seen corresponding path program 2 times [2023-01-27 18:07:56,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:56,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887360205] [2023-01-27 18:07:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:56,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:57,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887360205] [2023-01-27 18:07:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887360205] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:57,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:57,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:07:57,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991896327] [2023-01-27 18:07:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:57,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:07:57,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:57,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:07:57,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:07:57,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-01-27 18:07:57,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 533 flow. Second operand has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:57,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-01-27 18:07:57,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:57,341 INFO L130 PetriNetUnfolder]: 1148/1838 cut-off events. [2023-01-27 18:07:57,342 INFO L131 PetriNetUnfolder]: For 4269/4397 co-relation queries the response was YES. [2023-01-27 18:07:57,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7273 conditions, 1838 events. 1148/1838 cut-off events. For 4269/4397 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9246 event pairs, 149 based on Foata normal form. 85/1885 useless extension candidates. Maximal degree in co-relation 7245. Up to 704 conditions per place. [2023-01-27 18:07:57,354 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 103 selfloop transitions, 18 changer transitions 13/146 dead transitions. [2023-01-27 18:07:57,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 146 transitions, 1309 flow [2023-01-27 18:07:57,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:07:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:07:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 929 transitions. [2023-01-27 18:07:57,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899789029535865 [2023-01-27 18:07:57,358 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 929 transitions. [2023-01-27 18:07:57,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 929 transitions. [2023-01-27 18:07:57,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:57,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 929 transitions. [2023-01-27 18:07:57,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,365 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,365 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 533 flow. Second operand 8 states and 929 transitions. [2023-01-27 18:07:57,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 146 transitions, 1309 flow [2023-01-27 18:07:57,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 146 transitions, 1250 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-01-27 18:07:57,393 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 561 flow [2023-01-27 18:07:57,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=561, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2023-01-27 18:07:57,394 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-01-27 18:07:57,394 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 561 flow [2023-01-27 18:07:57,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:57,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:57,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:07:57,395 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:57,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:57,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1165111546, now seen corresponding path program 1 times [2023-01-27 18:07:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:57,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646188172] [2023-01-27 18:07:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:57,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:57,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646188172] [2023-01-27 18:07:57,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646188172] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:57,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:57,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:07:57,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715743007] [2023-01-27 18:07:57,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:57,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:07:57,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:57,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:07:57,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:07:57,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-01-27 18:07:57,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 561 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:57,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:57,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-01-27 18:07:57,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:58,079 INFO L130 PetriNetUnfolder]: 1804/2767 cut-off events. [2023-01-27 18:07:58,080 INFO L131 PetriNetUnfolder]: For 8183/8183 co-relation queries the response was YES. [2023-01-27 18:07:58,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12090 conditions, 2767 events. 1804/2767 cut-off events. For 8183/8183 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12946 event pairs, 270 based on Foata normal form. 1/2768 useless extension candidates. Maximal degree in co-relation 12060. Up to 1892 conditions per place. [2023-01-27 18:07:58,097 INFO L137 encePairwiseOnDemand]: 229/237 looper letters, 118 selfloop transitions, 37 changer transitions 10/165 dead transitions. [2023-01-27 18:07:58,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 165 transitions, 1548 flow [2023-01-27 18:07:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:07:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:07:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-01-27 18:07:58,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063291139240507 [2023-01-27 18:07:58,099 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-01-27 18:07:58,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-01-27 18:07:58,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:58,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-01-27 18:07:58,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,103 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,103 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 561 flow. Second operand 5 states and 600 transitions. [2023-01-27 18:07:58,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 165 transitions, 1548 flow [2023-01-27 18:07:58,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 165 transitions, 1397 flow, removed 37 selfloop flow, removed 7 redundant places. [2023-01-27 18:07:58,140 INFO L231 Difference]: Finished difference. Result has 68 places, 91 transitions, 779 flow [2023-01-27 18:07:58,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=779, PETRI_PLACES=68, PETRI_TRANSITIONS=91} [2023-01-27 18:07:58,142 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2023-01-27 18:07:58,142 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 91 transitions, 779 flow [2023-01-27 18:07:58,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:58,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:58,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:07:58,143 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:58,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:58,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1113448254, now seen corresponding path program 2 times [2023-01-27 18:07:58,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:58,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100609043] [2023-01-27 18:07:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:58,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:58,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:58,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100609043] [2023-01-27 18:07:58,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100609043] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:58,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:58,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:07:58,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912852060] [2023-01-27 18:07:58,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:58,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:07:58,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:58,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:07:58,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:07:58,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-01-27 18:07:58,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 91 transitions, 779 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:58,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-01-27 18:07:58,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:58,812 INFO L130 PetriNetUnfolder]: 1639/2666 cut-off events. [2023-01-27 18:07:58,813 INFO L131 PetriNetUnfolder]: For 7622/7741 co-relation queries the response was YES. [2023-01-27 18:07:58,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11108 conditions, 2666 events. 1639/2666 cut-off events. For 7622/7741 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 14342 event pairs, 287 based on Foata normal form. 5/2629 useless extension candidates. Maximal degree in co-relation 11079. Up to 1297 conditions per place. [2023-01-27 18:07:58,828 INFO L137 encePairwiseOnDemand]: 234/237 looper letters, 72 selfloop transitions, 1 changer transitions 68/149 dead transitions. [2023-01-27 18:07:58,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 149 transitions, 1407 flow [2023-01-27 18:07:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:07:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:07:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2023-01-27 18:07:58,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210970464135021 [2023-01-27 18:07:58,830 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2023-01-27 18:07:58,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2023-01-27 18:07:58,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:58,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2023-01-27 18:07:58,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,834 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,834 INFO L175 Difference]: Start difference. First operand has 68 places, 91 transitions, 779 flow. Second operand 4 states and 494 transitions. [2023-01-27 18:07:58,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 149 transitions, 1407 flow [2023-01-27 18:07:58,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 149 transitions, 1397 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-01-27 18:07:58,879 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 505 flow [2023-01-27 18:07:58,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=505, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2023-01-27 18:07:58,879 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-01-27 18:07:58,880 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 505 flow [2023-01-27 18:07:58,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:58,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:58,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:58,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:07:58,881 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:58,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1068422938, now seen corresponding path program 3 times [2023-01-27 18:07:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:58,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083309646] [2023-01-27 18:07:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:58,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:59,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:59,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083309646] [2023-01-27 18:07:59,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083309646] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:59,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:59,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:07:59,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744217377] [2023-01-27 18:07:59,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:59,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:07:59,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:59,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:07:59,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:07:59,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-01-27 18:07:59,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:59,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-01-27 18:07:59,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:59,462 INFO L130 PetriNetUnfolder]: 1191/1976 cut-off events. [2023-01-27 18:07:59,462 INFO L131 PetriNetUnfolder]: For 6869/6961 co-relation queries the response was YES. [2023-01-27 18:07:59,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8413 conditions, 1976 events. 1191/1976 cut-off events. For 6869/6961 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10290 event pairs, 263 based on Foata normal form. 1/1965 useless extension candidates. Maximal degree in co-relation 8388. Up to 1093 conditions per place. [2023-01-27 18:07:59,471 INFO L137 encePairwiseOnDemand]: 234/237 looper letters, 43 selfloop transitions, 1 changer transitions 68/115 dead transitions. [2023-01-27 18:07:59,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 115 transitions, 998 flow [2023-01-27 18:07:59,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:07:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:07:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-01-27 18:07:59,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221518987341772 [2023-01-27 18:07:59,474 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-01-27 18:07:59,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-01-27 18:07:59,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:59,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-01-27 18:07:59,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,477 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,477 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 505 flow. Second operand 4 states and 495 transitions. [2023-01-27 18:07:59,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 115 transitions, 998 flow [2023-01-27 18:07:59,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 962 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-01-27 18:07:59,507 INFO L231 Difference]: Finished difference. Result has 69 places, 41 transitions, 248 flow [2023-01-27 18:07:59,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=69, PETRI_TRANSITIONS=41} [2023-01-27 18:07:59,508 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places. [2023-01-27 18:07:59,508 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 41 transitions, 248 flow [2023-01-27 18:07:59,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:59,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:59,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:07:59,509 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:59,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1776097520, now seen corresponding path program 4 times [2023-01-27 18:07:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:59,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000649118] [2023-01-27 18:07:59,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:07:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:07:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:07:59,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:07:59,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000649118] [2023-01-27 18:07:59,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000649118] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:07:59,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:07:59,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:07:59,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106733546] [2023-01-27 18:07:59,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:07:59,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:07:59,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:07:59,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:07:59,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:07:59,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-01-27 18:07:59,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 41 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:07:59,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-01-27 18:07:59,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:07:59,950 INFO L130 PetriNetUnfolder]: 577/998 cut-off events. [2023-01-27 18:07:59,950 INFO L131 PetriNetUnfolder]: For 2941/2949 co-relation queries the response was YES. [2023-01-27 18:07:59,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4054 conditions, 998 events. 577/998 cut-off events. For 2941/2949 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4974 event pairs, 172 based on Foata normal form. 1/970 useless extension candidates. Maximal degree in co-relation 4029. Up to 479 conditions per place. [2023-01-27 18:07:59,955 INFO L137 encePairwiseOnDemand]: 234/237 looper letters, 44 selfloop transitions, 1 changer transitions 29/76 dead transitions. [2023-01-27 18:07:59,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 585 flow [2023-01-27 18:07:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:07:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:07:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2023-01-27 18:07:59,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147679324894515 [2023-01-27 18:07:59,958 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 488 transitions. [2023-01-27 18:07:59,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 488 transitions. [2023-01-27 18:07:59,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:07:59,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 488 transitions. [2023-01-27 18:07:59,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,962 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,962 INFO L175 Difference]: Start difference. First operand has 69 places, 41 transitions, 248 flow. Second operand 4 states and 488 transitions. [2023-01-27 18:07:59,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 585 flow [2023-01-27 18:07:59,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 76 transitions, 555 flow, removed 11 selfloop flow, removed 8 redundant places. [2023-01-27 18:07:59,975 INFO L231 Difference]: Finished difference. Result has 60 places, 37 transitions, 195 flow [2023-01-27 18:07:59,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=60, PETRI_TRANSITIONS=37} [2023-01-27 18:07:59,976 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-01-27 18:07:59,976 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 37 transitions, 195 flow [2023-01-27 18:07:59,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:07:59,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:07:59,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:07:59,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:07:59,977 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:07:59,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:07:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2133310604, now seen corresponding path program 5 times [2023-01-27 18:07:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:07:59,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985462581] [2023-01-27 18:07:59,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:07:59,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:08:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:08:01,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:08:01,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985462581] [2023-01-27 18:08:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985462581] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:08:01,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:08:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:08:01,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756751145] [2023-01-27 18:08:01,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:08:01,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:08:01,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:08:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:08:01,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:08:01,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-01-27 18:08:01,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 37 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:01,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:08:01,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-01-27 18:08:01,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:08:01,202 INFO L130 PetriNetUnfolder]: 387/687 cut-off events. [2023-01-27 18:08:01,203 INFO L131 PetriNetUnfolder]: For 1693/1702 co-relation queries the response was YES. [2023-01-27 18:08:01,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 687 events. 387/687 cut-off events. For 1693/1702 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3373 event pairs, 86 based on Foata normal form. 2/647 useless extension candidates. Maximal degree in co-relation 2670. Up to 299 conditions per place. [2023-01-27 18:08:01,206 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 38 selfloop transitions, 5 changer transitions 24/70 dead transitions. [2023-01-27 18:08:01,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 522 flow [2023-01-27 18:08:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:08:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:08:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 886 transitions. [2023-01-27 18:08:01,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46729957805907174 [2023-01-27 18:08:01,209 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 886 transitions. [2023-01-27 18:08:01,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 886 transitions. [2023-01-27 18:08:01,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:08:01,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 886 transitions. [2023-01-27 18:08:01,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.75) internal successors, (886), 8 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:01,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:01,215 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:01,215 INFO L175 Difference]: Start difference. First operand has 60 places, 37 transitions, 195 flow. Second operand 8 states and 886 transitions. [2023-01-27 18:08:01,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 522 flow [2023-01-27 18:08:01,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 70 transitions, 514 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 18:08:01,224 INFO L231 Difference]: Finished difference. Result has 64 places, 37 transitions, 204 flow [2023-01-27 18:08:01,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=64, PETRI_TRANSITIONS=37} [2023-01-27 18:08:01,225 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-01-27 18:08:01,225 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 204 flow [2023-01-27 18:08:01,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:08:01,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:08:01,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:08:01,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:08:01,226 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:08:01,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:08:01,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1831508718, now seen corresponding path program 6 times [2023-01-27 18:08:01,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:08:01,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226159184] [2023-01-27 18:08:01,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:08:01,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:08:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:08:01,276 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:08:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:08:01,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:08:01,358 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:08:01,358 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:08:01,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:08:01,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:08:01,361 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1] [2023-01-27 18:08:01,366 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:08:01,366 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:08:01,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:08:01 BasicIcfg [2023-01-27 18:08:01,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:08:01,465 INFO L158 Benchmark]: Toolchain (without parser) took 17666.74ms. Allocated memory was 509.6MB in the beginning and 887.1MB in the end (delta: 377.5MB). Free memory was 458.5MB in the beginning and 375.3MB in the end (delta: 83.2MB). Peak memory consumption was 461.1MB. Max. memory is 16.0GB. [2023-01-27 18:08:01,465 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 329.3MB. Free memory is still 276.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:08:01,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.00ms. Allocated memory is still 509.6MB. Free memory was 458.1MB in the beginning and 434.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:08:01,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.04ms. Allocated memory is still 509.6MB. Free memory was 434.0MB in the beginning and 431.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-27 18:08:01,465 INFO L158 Benchmark]: Boogie Preprocessor took 30.59ms. Allocated memory is still 509.6MB. Free memory was 431.3MB in the beginning and 429.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:08:01,466 INFO L158 Benchmark]: RCFGBuilder took 620.03ms. Allocated memory is still 509.6MB. Free memory was 429.2MB in the beginning and 390.1MB in the end (delta: 39.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-01-27 18:08:01,466 INFO L158 Benchmark]: TraceAbstraction took 16449.26ms. Allocated memory was 509.6MB in the beginning and 887.1MB in the end (delta: 377.5MB). Free memory was 389.8MB in the beginning and 375.3MB in the end (delta: 14.4MB). Peak memory consumption was 394.0MB. Max. memory is 16.0GB. [2023-01-27 18:08:01,467 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.14ms. Allocated memory is still 329.3MB. Free memory is still 276.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 510.00ms. Allocated memory is still 509.6MB. Free memory was 458.1MB in the beginning and 434.0MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.04ms. Allocated memory is still 509.6MB. Free memory was 434.0MB in the beginning and 431.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.59ms. Allocated memory is still 509.6MB. Free memory was 431.3MB in the beginning and 429.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 620.03ms. Allocated memory is still 509.6MB. Free memory was 429.2MB in the beginning and 390.1MB in the end (delta: 39.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 16449.26ms. Allocated memory was 509.6MB in the beginning and 887.1MB in the end (delta: 377.5MB). Free memory was 389.8MB in the beginning and 375.3MB in the end (delta: 14.4MB). Peak memory consumption was 394.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 136 PlacesBefore, 40 PlacesAfterwards, 125 TransitionsBefore, 28 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 6245 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2952, independent: 2761, independent conditional: 0, independent unconditional: 2761, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1480, independent: 1439, independent conditional: 0, independent unconditional: 1439, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2952, independent: 1322, independent conditional: 0, independent unconditional: 1322, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 1480, unknown conditional: 0, unknown unconditional: 1480] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=-3, t445={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=-2, t445={5:0}, t446={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=-1, t445={5:0}, t446={6:0}, t447={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 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) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L844] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 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 [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice2=0, x=1, y=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1509 IncrementalHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 24 mSDtfsCounter, 1509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=779occurred in iteration=10, InterpolantAutomatonStates: 78, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 1762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:08:01,484 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...