/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/mix032.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:10:54,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:10:54,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:10:54,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:10:54,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:10:54,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:10:54,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:10:54,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:10:54,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:10:54,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:10:54,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:10:54,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:10:54,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:10:54,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:10:54,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:10:54,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:10:54,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:10:54,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:10:54,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:10:54,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:10:54,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:10:54,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:10:54,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:10:54,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:10:54,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:10:54,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:10:54,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:10:54,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:10:54,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:10:54,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:10:54,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:10:54,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:10:54,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:10:54,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:10:54,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:10:54,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:10:54,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:10:54,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:10:54,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:10:54,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:10:54,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:10:54,205 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:10:54,239 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:10:54,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:10:54,239 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:10:54,240 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:10:54,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:10:54,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:10:54,240 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:10:54,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:10:54,240 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:10:54,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:10:54,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:10:54,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:10:54,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:10:54,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:10:54,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:10:54,241 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:10:54,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:10:54,241 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:10:54,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:10:54,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:10:54,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:10:54,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:10:54,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:10:54,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:10:54,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:10:54,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:10:54,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:10:54,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:10:54,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:10:54,242 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:10:54,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:10:54,242 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:10:54,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:10:54,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:10:54,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:10:54,458 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:10:54,459 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:10:54,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i [2023-01-27 18:10:55,466 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:10:55,671 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:10:55,671 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.opt.i [2023-01-27 18:10:55,685 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba151087d/5a711b5bee534ea19da963815b18c3a3/FLAG5b13664c1 [2023-01-27 18:10:55,696 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba151087d/5a711b5bee534ea19da963815b18c3a3 [2023-01-27 18:10:55,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:10:55,698 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:10:55,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:10:55,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:10:55,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:10:55,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:10:55" (1/1) ... [2023-01-27 18:10:55,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc3873c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:55, skipping insertion in model container [2023-01-27 18:10:55,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:10:55" (1/1) ... [2023-01-27 18:10:55,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:10:55,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:10:55,859 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/mix032.opt.i[944,957] [2023-01-27 18:10:56,047 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:10:56,057 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:10:56,066 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/mix032.opt.i[944,957] [2023-01-27 18:10:56,127 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:10:56,146 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:10:56,146 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:10:56,151 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:10:56,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:56 WrapperNode [2023-01-27 18:10:56,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:10:56,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:10:56,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:10:56,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:10:56,157 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:10:56" (1/1) ... [2023-01-27 18:10:56,190 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:10:56" (1/1) ... [2023-01-27 18:10:56,216 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-01-27 18:10:56,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:10:56,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:10:56,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:10:56,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:10:56,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:56" (1/1) ... [2023-01-27 18:10:56,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:56" (1/1) ... [2023-01-27 18:10:56,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:56" (1/1) ... [2023-01-27 18:10:56,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:56" (1/1) ... [2023-01-27 18:10:56,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:56" (1/1) ... [2023-01-27 18:10:56,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:56" (1/1) ... [2023-01-27 18:10:56,248 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:56" (1/1) ... [2023-01-27 18:10:56,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:56" (1/1) ... [2023-01-27 18:10:56,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:10:56,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:10:56,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:10:56,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:10:56,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:56" (1/1) ... [2023-01-27 18:10:56,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:10:56,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:10:56,306 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:10:56,341 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:10:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:10:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:10:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:10:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:10:56,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:10:56,354 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:10:56,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:10:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:10:56,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:10:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:10:56,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:10:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:10:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:10:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:10:56,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:10:56,356 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:10:56,499 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:10:56,500 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:10:56,752 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:10:56,884 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:10:56,884 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:10:56,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:10:56 BoogieIcfgContainer [2023-01-27 18:10:56,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:10:56,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:10:56,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:10:56,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:10:56,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:10:55" (1/3) ... [2023-01-27 18:10:56,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e94afa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:10:56, skipping insertion in model container [2023-01-27 18:10:56,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:10:56" (2/3) ... [2023-01-27 18:10:56,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e94afa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:10:56, skipping insertion in model container [2023-01-27 18:10:56,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:10:56" (3/3) ... [2023-01-27 18:10:56,892 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.opt.i [2023-01-27 18:10:56,904 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:10:56,904 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:10:56,905 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:10:56,954 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:10:56,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2023-01-27 18:10:57,044 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-27 18:10:57,045 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:10:57,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-27 18:10:57,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2023-01-27 18:10:57,056 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-01-27 18:10:57,059 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:10:57,075 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-27 18:10:57,077 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-01-27 18:10:57,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-01-27 18:10:57,109 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2023-01-27 18:10:57,109 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:10:57,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-01-27 18:10:57,111 INFO L119 LiptonReduction]: Number of co-enabled transitions 2048 [2023-01-27 18:11:00,198 INFO L134 LiptonReduction]: Checked pairs total: 5098 [2023-01-27 18:11:00,198 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-01-27 18:11:00,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:11:00,212 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;@16a7fd57, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:11:00,212 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:11:00,215 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-01-27 18:11:00,215 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:11:00,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:00,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:00,216 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:00,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:00,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1984698841, now seen corresponding path program 1 times [2023-01-27 18:11:00,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:00,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890234705] [2023-01-27 18:11:00,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:00,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:00,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890234705] [2023-01-27 18:11:00,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890234705] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:00,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:00,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:11:00,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258725296] [2023-01-27 18:11:00,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:00,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:11:00,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:00,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:11:00,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:11:00,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 215 [2023-01-27 18:11:00,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:11:00,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:00,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 215 [2023-01-27 18:11:00,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:00,751 INFO L130 PetriNetUnfolder]: 644/1039 cut-off events. [2023-01-27 18:11:00,751 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 18:11:00,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2051 conditions, 1039 events. 644/1039 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5011 event pairs, 112 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 2040. Up to 773 conditions per place. [2023-01-27 18:11:00,761 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 24 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-01-27 18:11:00,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 127 flow [2023-01-27 18:11:00,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:11:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:11:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-01-27 18:11:00,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271317829457365 [2023-01-27 18:11:00,776 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-01-27 18:11:00,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-01-27 18:11:00,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:00,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-01-27 18:11:00,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 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:11:00,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:11:00,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:11:00,791 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 340 transitions. [2023-01-27 18:11:00,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 127 flow [2023-01-27 18:11:00,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:11:00,795 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-01-27 18:11:00,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-01-27 18:11:00,798 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-01-27 18:11:00,799 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-01-27 18:11:00,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:11:00,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:00,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:00,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:11:00,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:00,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash 330161126, now seen corresponding path program 1 times [2023-01-27 18:11:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:00,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104207493] [2023-01-27 18:11:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:00,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:01,079 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:11:01,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:01,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104207493] [2023-01-27 18:11:01,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104207493] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:01,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:01,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:11:01,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142511978] [2023-01-27 18:11:01,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:01,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:11:01,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:11:01,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:11:01,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 215 [2023-01-27 18:11:01,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:11:01,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:01,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 215 [2023-01-27 18:11:01,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:01,268 INFO L130 PetriNetUnfolder]: 1069/1590 cut-off events. [2023-01-27 18:11:01,268 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2023-01-27 18:11:01,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1590 events. 1069/1590 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6321 event pairs, 409 based on Foata normal form. 8/1598 useless extension candidates. Maximal degree in co-relation 3300. Up to 1515 conditions per place. [2023-01-27 18:11:01,274 INFO L137 encePairwiseOnDemand]: 210/215 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2023-01-27 18:11:01,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 148 flow [2023-01-27 18:11:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:11:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:11:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-01-27 18:11:01,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48992248062015503 [2023-01-27 18:11:01,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-01-27 18:11:01,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-01-27 18:11:01,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:01,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-01-27 18:11:01,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:11:01,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:11:01,278 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:11:01,278 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 316 transitions. [2023-01-27 18:11:01,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 148 flow [2023-01-27 18:11:01,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:01,279 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 74 flow [2023-01-27 18:11:01,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-01-27 18:11:01,280 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-01-27 18:11:01,280 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 74 flow [2023-01-27 18:11:01,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:11:01,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:01,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:01,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:11:01,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:01,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:01,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1088399593, now seen corresponding path program 1 times [2023-01-27 18:11:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:01,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772235346] [2023-01-27 18:11:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:01,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:01,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772235346] [2023-01-27 18:11:01,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772235346] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:01,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:01,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:11:01,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365588036] [2023-01-27 18:11:01,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:01,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:11:01,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:01,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:11:01,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:11:01,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 215 [2023-01-27 18:11:01,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:11:01,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:01,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 215 [2023-01-27 18:11:01,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:01,616 INFO L130 PetriNetUnfolder]: 969/1450 cut-off events. [2023-01-27 18:11:01,616 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2023-01-27 18:11:01,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3345 conditions, 1450 events. 969/1450 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5774 event pairs, 375 based on Foata normal form. 40/1490 useless extension candidates. Maximal degree in co-relation 3334. Up to 1003 conditions per place. [2023-01-27 18:11:01,623 INFO L137 encePairwiseOnDemand]: 212/215 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-01-27 18:11:01,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 176 flow [2023-01-27 18:11:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:11:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:11:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-01-27 18:11:01,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48992248062015503 [2023-01-27 18:11:01,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-01-27 18:11:01,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-01-27 18:11:01,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:01,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-01-27 18:11:01,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:11:01,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:11:01,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:11:01,627 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 74 flow. Second operand 3 states and 316 transitions. [2023-01-27 18:11:01,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 176 flow [2023-01-27 18:11:01,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:11:01,630 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 81 flow [2023-01-27 18:11:01,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-01-27 18:11:01,631 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-01-27 18:11:01,633 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 81 flow [2023-01-27 18:11:01,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:11:01,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:01,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:01,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:11:01,634 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:01,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1825019559, now seen corresponding path program 1 times [2023-01-27 18:11:01,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:01,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706761251] [2023-01-27 18:11:01,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:01,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:01,806 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:11:01,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:01,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706761251] [2023-01-27 18:11:01,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706761251] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:01,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:01,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:11:01,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316512902] [2023-01-27 18:11:01,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:01,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:11:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:01,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:11:01,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:11:01,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 215 [2023-01-27 18:11:01,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:11:01,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:01,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 215 [2023-01-27 18:11:01,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:01,929 INFO L130 PetriNetUnfolder]: 911/1368 cut-off events. [2023-01-27 18:11:01,929 INFO L131 PetriNetUnfolder]: For 480/480 co-relation queries the response was YES. [2023-01-27 18:11:01,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 1368 events. 911/1368 cut-off events. For 480/480 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5179 event pairs, 287 based on Foata normal form. 24/1392 useless extension candidates. Maximal degree in co-relation 3290. Up to 925 conditions per place. [2023-01-27 18:11:01,936 INFO L137 encePairwiseOnDemand]: 212/215 looper letters, 30 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-01-27 18:11:01,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 172 flow [2023-01-27 18:11:01,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:11:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:11:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-01-27 18:11:01,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48527131782945737 [2023-01-27 18:11:01,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-01-27 18:11:01,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-01-27 18:11:01,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:01,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-01-27 18:11:01,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 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:11:01,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:11:01,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:11:01,943 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 81 flow. Second operand 3 states and 313 transitions. [2023-01-27 18:11:01,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 172 flow [2023-01-27 18:11:01,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:01,945 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 86 flow [2023-01-27 18:11:01,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-01-27 18:11:01,947 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-01-27 18:11:01,947 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 86 flow [2023-01-27 18:11:01,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:11:01,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:01,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:01,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:11:01,947 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:01,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash 481837373, now seen corresponding path program 1 times [2023-01-27 18:11:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:01,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511027821] [2023-01-27 18:11:01,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:01,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:02,105 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:11:02,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511027821] [2023-01-27 18:11:02,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511027821] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:02,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:02,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:11:02,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336978337] [2023-01-27 18:11:02,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:02,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:11:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:02,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:11:02,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:11:02,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 215 [2023-01-27 18:11:02,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 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:11:02,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:02,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 215 [2023-01-27 18:11:02,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:02,256 INFO L130 PetriNetUnfolder]: 465/813 cut-off events. [2023-01-27 18:11:02,256 INFO L131 PetriNetUnfolder]: For 246/250 co-relation queries the response was YES. [2023-01-27 18:11:02,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1912 conditions, 813 events. 465/813 cut-off events. For 246/250 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3922 event pairs, 90 based on Foata normal form. 88/885 useless extension candidates. Maximal degree in co-relation 1898. Up to 460 conditions per place. [2023-01-27 18:11:02,259 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 43 selfloop transitions, 7 changer transitions 2/57 dead transitions. [2023-01-27 18:11:02,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 280 flow [2023-01-27 18:11:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:11:02,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:11:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2023-01-27 18:11:02,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49953488372093025 [2023-01-27 18:11:02,261 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 537 transitions. [2023-01-27 18:11:02,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 537 transitions. [2023-01-27 18:11:02,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:02,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 537 transitions. [2023-01-27 18:11:02,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 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:11:02,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:11:02,264 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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:11:02,264 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 86 flow. Second operand 5 states and 537 transitions. [2023-01-27 18:11:02,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 280 flow [2023-01-27 18:11:02,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:02,267 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 134 flow [2023-01-27 18:11:02,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-01-27 18:11:02,269 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-01-27 18:11:02,269 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 134 flow [2023-01-27 18:11:02,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 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:11:02,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:02,269 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:11:02,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:11:02,270 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:02,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:02,270 INFO L85 PathProgramCache]: Analyzing trace with hash 679535478, now seen corresponding path program 1 times [2023-01-27 18:11:02,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:02,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494476805] [2023-01-27 18:11:02,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:02,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:02,438 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:11:02,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:02,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494476805] [2023-01-27 18:11:02,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494476805] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:02,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:02,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:02,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334401365] [2023-01-27 18:11:02,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:02,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:02,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:02,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:02,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:02,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 215 [2023-01-27 18:11:02,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 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:11:02,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:02,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 215 [2023-01-27 18:11:02,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:02,584 INFO L130 PetriNetUnfolder]: 335/627 cut-off events. [2023-01-27 18:11:02,584 INFO L131 PetriNetUnfolder]: For 354/355 co-relation queries the response was YES. [2023-01-27 18:11:02,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 627 events. 335/627 cut-off events. For 354/355 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3034 event pairs, 52 based on Foata normal form. 49/662 useless extension candidates. Maximal degree in co-relation 1844. Up to 213 conditions per place. [2023-01-27 18:11:02,587 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 50 selfloop transitions, 13 changer transitions 9/77 dead transitions. [2023-01-27 18:11:02,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 77 transitions, 434 flow [2023-01-27 18:11:02,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:11:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:11:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 751 transitions. [2023-01-27 18:11:02,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49900332225913624 [2023-01-27 18:11:02,589 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 751 transitions. [2023-01-27 18:11:02,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 751 transitions. [2023-01-27 18:11:02,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:02,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 751 transitions. [2023-01-27 18:11:02,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 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:11:02,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:11:02,593 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:11:02,593 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 134 flow. Second operand 7 states and 751 transitions. [2023-01-27 18:11:02,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 77 transitions, 434 flow [2023-01-27 18:11:02,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 77 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:11:02,596 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 218 flow [2023-01-27 18:11:02,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-01-27 18:11:02,596 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2023-01-27 18:11:02,596 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 218 flow [2023-01-27 18:11:02,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 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:11:02,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:02,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:02,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:11:02,597 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:02,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1820285763, now seen corresponding path program 1 times [2023-01-27 18:11:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:02,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829429883] [2023-01-27 18:11:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:02,812 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:11:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829429883] [2023-01-27 18:11:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829429883] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:02,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:02,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011784967] [2023-01-27 18:11:02,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:02,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:02,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:02,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:02,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 215 [2023-01-27 18:11:02,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 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:11:02,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:02,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 215 [2023-01-27 18:11:02,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:03,019 INFO L130 PetriNetUnfolder]: 679/1178 cut-off events. [2023-01-27 18:11:03,019 INFO L131 PetriNetUnfolder]: For 2160/2160 co-relation queries the response was YES. [2023-01-27 18:11:03,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4149 conditions, 1178 events. 679/1178 cut-off events. For 2160/2160 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5719 event pairs, 67 based on Foata normal form. 7/1185 useless extension candidates. Maximal degree in co-relation 4128. Up to 656 conditions per place. [2023-01-27 18:11:03,026 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 49 selfloop transitions, 8 changer transitions 37/94 dead transitions. [2023-01-27 18:11:03,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 94 transitions, 733 flow [2023-01-27 18:11:03,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:11:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:11:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 617 transitions. [2023-01-27 18:11:03,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782945736434108 [2023-01-27 18:11:03,028 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 617 transitions. [2023-01-27 18:11:03,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 617 transitions. [2023-01-27 18:11:03,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:03,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 617 transitions. [2023-01-27 18:11:03,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:03,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:11:03,031 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:11:03,031 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 218 flow. Second operand 6 states and 617 transitions. [2023-01-27 18:11:03,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 94 transitions, 733 flow [2023-01-27 18:11:03,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 651 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:03,041 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 184 flow [2023-01-27 18:11:03,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2023-01-27 18:11:03,042 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2023-01-27 18:11:03,042 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 184 flow [2023-01-27 18:11:03,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 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:11:03,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:03,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:03,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:11:03,042 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:03,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash 499994649, now seen corresponding path program 2 times [2023-01-27 18:11:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:03,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839757746] [2023-01-27 18:11:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:03,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:03,202 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:11:03,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:03,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839757746] [2023-01-27 18:11:03,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839757746] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:03,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:03,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:11:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448404723] [2023-01-27 18:11:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:03,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:11:03,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:03,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:11:03,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:11:03,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 215 [2023-01-27 18:11:03,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 33 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:11:03,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:03,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 215 [2023-01-27 18:11:03,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:03,305 INFO L130 PetriNetUnfolder]: 196/398 cut-off events. [2023-01-27 18:11:03,305 INFO L131 PetriNetUnfolder]: For 472/475 co-relation queries the response was YES. [2023-01-27 18:11:03,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 398 events. 196/398 cut-off events. For 472/475 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1800 event pairs, 50 based on Foata normal form. 21/407 useless extension candidates. Maximal degree in co-relation 1257. Up to 146 conditions per place. [2023-01-27 18:11:03,309 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 32 selfloop transitions, 10 changer transitions 15/61 dead transitions. [2023-01-27 18:11:03,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 398 flow [2023-01-27 18:11:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:11:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:11:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2023-01-27 18:11:03,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870431893687708 [2023-01-27 18:11:03,311 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions. [2023-01-27 18:11:03,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions. [2023-01-27 18:11:03,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:03,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions. [2023-01-27 18:11:03,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 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:11:03,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:11:03,315 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:11:03,315 INFO L175 Difference]: Start difference. First operand has 52 places, 33 transitions, 184 flow. Second operand 7 states and 733 transitions. [2023-01-27 18:11:03,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 398 flow [2023-01-27 18:11:03,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 355 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-01-27 18:11:03,317 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 160 flow [2023-01-27 18:11:03,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2023-01-27 18:11:03,318 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-01-27 18:11:03,318 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 160 flow [2023-01-27 18:11:03,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:11:03,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:03,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:03,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:11:03,319 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:03,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash 766428093, now seen corresponding path program 1 times [2023-01-27 18:11:03,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:03,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621559465] [2023-01-27 18:11:03,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:03,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:03,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:03,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:03,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621559465] [2023-01-27 18:11:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621559465] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:03,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:03,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:11:03,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162840386] [2023-01-27 18:11:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:03,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:11:03,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:11:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:11:03,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 215 [2023-01-27 18:11:03,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 29 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 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:11:03,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:03,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 215 [2023-01-27 18:11:03,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:03,854 INFO L130 PetriNetUnfolder]: 259/500 cut-off events. [2023-01-27 18:11:03,854 INFO L131 PetriNetUnfolder]: For 814/814 co-relation queries the response was YES. [2023-01-27 18:11:03,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1682 conditions, 500 events. 259/500 cut-off events. For 814/814 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2175 event pairs, 30 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 1665. Up to 184 conditions per place. [2023-01-27 18:11:03,857 INFO L137 encePairwiseOnDemand]: 205/215 looper letters, 54 selfloop transitions, 23 changer transitions 20/97 dead transitions. [2023-01-27 18:11:03,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 97 transitions, 714 flow [2023-01-27 18:11:03,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 18:11:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 18:11:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 946 transitions. [2023-01-27 18:11:03,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2023-01-27 18:11:03,859 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 946 transitions. [2023-01-27 18:11:03,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 946 transitions. [2023-01-27 18:11:03,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:03,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 946 transitions. [2023-01-27 18:11:03,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 0 states have call successors, (0), 0 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:11:03,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 215.0) internal successors, (2365), 11 states have internal predecessors, (2365), 0 states have call successors, (0), 0 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:11:03,864 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 215.0) internal successors, (2365), 11 states have internal predecessors, (2365), 0 states have call successors, (0), 0 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:11:03,864 INFO L175 Difference]: Start difference. First operand has 51 places, 29 transitions, 160 flow. Second operand 10 states and 946 transitions. [2023-01-27 18:11:03,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 97 transitions, 714 flow [2023-01-27 18:11:03,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 97 transitions, 611 flow, removed 19 selfloop flow, removed 8 redundant places. [2023-01-27 18:11:03,867 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 272 flow [2023-01-27 18:11:03,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=272, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2023-01-27 18:11:03,868 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-01-27 18:11:03,868 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 272 flow [2023-01-27 18:11:03,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 0 states have call successors, (0), 0 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:11:03,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:03,868 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] [2023-01-27 18:11:03,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:11:03,868 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:03,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash -559904863, now seen corresponding path program 2 times [2023-01-27 18:11:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945843792] [2023-01-27 18:11:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:04,027 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:11:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945843792] [2023-01-27 18:11:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945843792] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:04,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:04,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:04,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247690161] [2023-01-27 18:11:04,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:04,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:04,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:04,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:04,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 215 [2023-01-27 18:11:04,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 272 flow. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:11:04,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:04,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 215 [2023-01-27 18:11:04,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:04,155 INFO L130 PetriNetUnfolder]: 291/573 cut-off events. [2023-01-27 18:11:04,155 INFO L131 PetriNetUnfolder]: For 933/933 co-relation queries the response was YES. [2023-01-27 18:11:04,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2214 conditions, 573 events. 291/573 cut-off events. For 933/933 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2644 event pairs, 71 based on Foata normal form. 1/574 useless extension candidates. Maximal degree in co-relation 2193. Up to 273 conditions per place. [2023-01-27 18:11:04,157 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 26 selfloop transitions, 3 changer transitions 49/78 dead transitions. [2023-01-27 18:11:04,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 78 transitions, 584 flow [2023-01-27 18:11:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:11:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:11:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2023-01-27 18:11:04,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4689922480620155 [2023-01-27 18:11:04,159 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 605 transitions. [2023-01-27 18:11:04,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions. [2023-01-27 18:11:04,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:04,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions. [2023-01-27 18:11:04,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 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:11:04,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:11:04,162 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:11:04,162 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 272 flow. Second operand 6 states and 605 transitions. [2023-01-27 18:11:04,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 78 transitions, 584 flow [2023-01-27 18:11:04,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 584 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 18:11:04,166 INFO L231 Difference]: Finished difference. Result has 57 places, 27 transitions, 149 flow [2023-01-27 18:11:04,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=57, PETRI_TRANSITIONS=27} [2023-01-27 18:11:04,166 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2023-01-27 18:11:04,166 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 27 transitions, 149 flow [2023-01-27 18:11:04,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:11:04,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:04,167 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] [2023-01-27 18:11:04,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:11:04,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:04,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:04,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1023391103, now seen corresponding path program 3 times [2023-01-27 18:11:04,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:04,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247443705] [2023-01-27 18:11:04,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:04,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:04,762 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:11:04,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:04,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247443705] [2023-01-27 18:11:04,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247443705] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:04,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:04,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:04,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652761244] [2023-01-27 18:11:04,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:04,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:04,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:04,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:04,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:04,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 215 [2023-01-27 18:11:04,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 27 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 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:11:04,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:04,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 215 [2023-01-27 18:11:04,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:04,898 INFO L130 PetriNetUnfolder]: 82/190 cut-off events. [2023-01-27 18:11:04,898 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2023-01-27 18:11:04,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 190 events. 82/190 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 701 event pairs, 14 based on Foata normal form. 1/191 useless extension candidates. Maximal degree in co-relation 750. Up to 62 conditions per place. [2023-01-27 18:11:04,899 INFO L137 encePairwiseOnDemand]: 208/215 looper letters, 24 selfloop transitions, 4 changer transitions 24/52 dead transitions. [2023-01-27 18:11:04,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 398 flow [2023-01-27 18:11:04,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:11:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:11:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 641 transitions. [2023-01-27 18:11:04,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42591362126245846 [2023-01-27 18:11:04,901 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 641 transitions. [2023-01-27 18:11:04,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 641 transitions. [2023-01-27 18:11:04,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:04,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 641 transitions. [2023-01-27 18:11:04,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 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:11:04,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:11:04,904 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:11:04,904 INFO L175 Difference]: Start difference. First operand has 57 places, 27 transitions, 149 flow. Second operand 7 states and 641 transitions. [2023-01-27 18:11:04,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 398 flow [2023-01-27 18:11:04,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 360 flow, removed 12 selfloop flow, removed 8 redundant places. [2023-01-27 18:11:04,906 INFO L231 Difference]: Finished difference. Result has 51 places, 27 transitions, 142 flow [2023-01-27 18:11:04,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=51, PETRI_TRANSITIONS=27} [2023-01-27 18:11:04,907 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2023-01-27 18:11:04,907 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 27 transitions, 142 flow [2023-01-27 18:11:04,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 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:11:04,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:04,907 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] [2023-01-27 18:11:04,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:11:04,907 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:04,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash -833015925, now seen corresponding path program 4 times [2023-01-27 18:11:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:04,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738371124] [2023-01-27 18:11:04,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:11:04,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:11:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:11:04,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:11:04,976 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:11:04,977 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:11:04,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:11:04,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:11:04,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:11:04,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:11:04,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:11:04,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:11:04,979 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:04,982 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:11:04,983 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:11:05,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:11:05 BasicIcfg [2023-01-27 18:11:05,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:11:05,020 INFO L158 Benchmark]: Toolchain (without parser) took 9321.75ms. Allocated memory was 316.7MB in the beginning and 459.3MB in the end (delta: 142.6MB). Free memory was 263.6MB in the beginning and 342.4MB in the end (delta: -78.8MB). Peak memory consumption was 66.5MB. Max. memory is 16.0GB. [2023-01-27 18:11:05,020 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 214.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:11:05,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.51ms. Allocated memory is still 316.7MB. Free memory was 263.4MB in the beginning and 286.8MB in the end (delta: -23.4MB). Peak memory consumption was 24.7MB. Max. memory is 16.0GB. [2023-01-27 18:11:05,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.40ms. Allocated memory is still 316.7MB. Free memory was 286.8MB in the beginning and 284.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:11:05,021 INFO L158 Benchmark]: Boogie Preprocessor took 33.49ms. Allocated memory is still 316.7MB. Free memory was 284.6MB in the beginning and 282.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:11:05,021 INFO L158 Benchmark]: RCFGBuilder took 634.67ms. Allocated memory is still 316.7MB. Free memory was 282.5MB in the beginning and 251.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-01-27 18:11:05,021 INFO L158 Benchmark]: TraceAbstraction took 8131.88ms. Allocated memory was 316.7MB in the beginning and 459.3MB in the end (delta: 142.6MB). Free memory was 250.4MB in the beginning and 342.4MB in the end (delta: -92.0MB). Peak memory consumption was 50.2MB. Max. memory is 16.0GB. [2023-01-27 18:11:05,022 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 214.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 452.51ms. Allocated memory is still 316.7MB. Free memory was 263.4MB in the beginning and 286.8MB in the end (delta: -23.4MB). Peak memory consumption was 24.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.40ms. Allocated memory is still 316.7MB. Free memory was 286.8MB in the beginning and 284.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.49ms. Allocated memory is still 316.7MB. Free memory was 284.6MB in the beginning and 282.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 634.67ms. Allocated memory is still 316.7MB. Free memory was 282.5MB in the beginning and 251.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 8131.88ms. Allocated memory was 316.7MB in the beginning and 459.3MB in the end (delta: 142.6MB). Free memory was 250.4MB in the beginning and 342.4MB in the end (delta: -92.0MB). Peak memory consumption was 50.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 120 PlacesBefore, 33 PlacesAfterwards, 112 TransitionsBefore, 24 TransitionsAfterwards, 2048 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, 5098 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2771, independent: 2589, independent conditional: 0, independent unconditional: 2589, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1208, independent: 1163, independent conditional: 0, independent unconditional: 1163, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2771, independent: 1426, independent conditional: 0, independent unconditional: 1426, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 1208, unknown conditional: 0, unknown unconditional: 1208] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [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$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L845] 0 pthread_t t852; [L846] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t852, ((void *)0), P0, ((void *)0))=-3, t852={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t853; [L848] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t853, ((void *)0), P1, ((void *)0))=-2, t852={5:0}, t853={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 0 pthread_t t854; [L850] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t854, ((void *)0), P2, ((void *)0))=-1, t852={5:0}, t853={6:0}, t854={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 3 z$w_buff1 = z$w_buff0 [L803] 3 z$w_buff0 = 1 [L804] 3 z$w_buff1_used = z$w_buff0_used [L805] 3 z$w_buff0_used = (_Bool)1 [L806] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L806] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 3 a = 1 [L817] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 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) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 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 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 848]: 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: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 837 IncrementalHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 31 mSDtfsCounter, 837 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=9, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 1642 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:11:05,090 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...