/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/mix035_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:11:31,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:11:31,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:11:31,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:11:31,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:11:31,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:11:31,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:11:31,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:11:31,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:11:31,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:11:31,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:11:31,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:11:31,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:11:31,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:11:31,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:11:31,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:11:31,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:11:31,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:11:31,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:11:31,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:11:31,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:11:31,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:11:31,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:11:31,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:11:31,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:11:31,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:11:31,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:11:31,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:11:31,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:11:31,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:11:31,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:11:31,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:11:31,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:11:31,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:11:31,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:11:31,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:11:31,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:11:31,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:11:31,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:11:31,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:11:31,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:11:31,357 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:11:31,394 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:11:31,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:11:31,395 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:11:31,395 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:11:31,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:11:31,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:11:31,396 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:11:31,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:11:31,396 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:11:31,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:11:31,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:11:31,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:11:31,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:11:31,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:11:31,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:11:31,401 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:11:31,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:11:31,401 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:11:31,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:11:31,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:11:31,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:11:31,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:11:31,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:11:31,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:11:31,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:11:31,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:11:31,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:11:31,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:11:31,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:11:31,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:11:31,403 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:11:31,403 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:11:31,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:11:31,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:11:31,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:11:31,826 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:11:31,828 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:11:31,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-01-27 18:11:33,681 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:11:34,025 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:11:34,026 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-01-27 18:11:34,041 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ab3a698/01381145bb6342229e87c7ab2fa46375/FLAG2ad4aad13 [2023-01-27 18:11:34,060 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ab3a698/01381145bb6342229e87c7ab2fa46375 [2023-01-27 18:11:34,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:11:34,063 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:11:34,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:11:34,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:11:34,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:11:34,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:11:34" (1/1) ... [2023-01-27 18:11:34,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@121a642e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34, skipping insertion in model container [2023-01-27 18:11:34,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:11:34" (1/1) ... [2023-01-27 18:11:34,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:11:34,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:11:34,397 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/mix035_power.opt_rmo.opt.i[1001,1014] [2023-01-27 18:11:34,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:11:34,599 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:11:34,625 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/mix035_power.opt_rmo.opt.i[1001,1014] [2023-01-27 18:11:34,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:11:34,761 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:11:34,761 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:11:34,766 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:11:34,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34 WrapperNode [2023-01-27 18:11:34,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:11:34,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:11:34,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:11:34,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:11:34,787 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:11:34" (1/1) ... [2023-01-27 18:11:34,811 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:11:34" (1/1) ... [2023-01-27 18:11:34,831 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2023-01-27 18:11:34,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:11:34,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:11:34,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:11:34,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:11:34,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34" (1/1) ... [2023-01-27 18:11:34,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34" (1/1) ... [2023-01-27 18:11:34,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34" (1/1) ... [2023-01-27 18:11:34,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34" (1/1) ... [2023-01-27 18:11:34,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34" (1/1) ... [2023-01-27 18:11:34,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34" (1/1) ... [2023-01-27 18:11:34,903 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34" (1/1) ... [2023-01-27 18:11:34,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34" (1/1) ... [2023-01-27 18:11:34,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:11:34,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:11:34,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:11:34,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:11:34,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34" (1/1) ... [2023-01-27 18:11:34,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:11:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:11:34,962 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:11:34,976 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:11:34,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:11:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:11:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:11:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:11:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:11:35,000 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:11:35,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:11:35,001 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:11:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:11:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:11:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:11:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:11:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:11:35,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:11:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:11:35,003 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:11:35,222 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:11:35,224 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:11:35,582 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:11:35,701 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:11:35,701 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:11:35,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:11:35 BoogieIcfgContainer [2023-01-27 18:11:35,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:11:35,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:11:35,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:11:35,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:11:35,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:11:34" (1/3) ... [2023-01-27 18:11:35,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b83e9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:11:35, skipping insertion in model container [2023-01-27 18:11:35,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:11:34" (2/3) ... [2023-01-27 18:11:35,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b83e9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:11:35, skipping insertion in model container [2023-01-27 18:11:35,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:11:35" (3/3) ... [2023-01-27 18:11:35,708 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2023-01-27 18:11:35,719 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:11:35,719 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:11:35,719 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:11:35,795 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:11:35,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2023-01-27 18:11:35,906 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2023-01-27 18:11:35,906 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:11:35,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-27 18:11:35,924 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2023-01-27 18:11:35,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-01-27 18:11:35,929 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:11:35,935 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-01-27 18:11:35,936 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-01-27 18:11:35,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-01-27 18:11:35,967 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2023-01-27 18:11:35,967 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:11:35,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-01-27 18:11:35,969 INFO L119 LiptonReduction]: Number of co-enabled transitions 1962 [2023-01-27 18:11:45,119 INFO L134 LiptonReduction]: Checked pairs total: 5282 [2023-01-27 18:11:45,119 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-01-27 18:11:45,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:11:45,146 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;@48b0f00a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:11:45,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:11:45,151 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-27 18:11:45,151 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:11:45,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:45,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:11:45,156 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:45,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash 453221755, now seen corresponding path program 1 times [2023-01-27 18:11:45,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:45,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949502651] [2023-01-27 18:11:45,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:45,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:45,847 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:45,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:45,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949502651] [2023-01-27 18:11:45,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949502651] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:45,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:45,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:11:45,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294109466] [2023-01-27 18:11:45,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:45,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:11:45,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:45,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:11:45,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:11:45,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 206 [2023-01-27 18:11:45,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:45,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:45,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 206 [2023-01-27 18:11:45,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:46,490 INFO L130 PetriNetUnfolder]: 999/1560 cut-off events. [2023-01-27 18:11:46,491 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-27 18:11:46,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 1560 events. 999/1560 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7390 event pairs, 277 based on Foata normal form. 64/1476 useless extension candidates. Maximal degree in co-relation 3084. Up to 1195 conditions per place. [2023-01-27 18:11:46,504 INFO L137 encePairwiseOnDemand]: 202/206 looper letters, 29 selfloop transitions, 2 changer transitions 4/38 dead transitions. [2023-01-27 18:11:46,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2023-01-27 18:11:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:11:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:11:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-01-27 18:11:46,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5420711974110033 [2023-01-27 18:11:46,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-01-27 18:11:46,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-01-27 18:11:46,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:46,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-01-27 18:11:46,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:46,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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:46,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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:46,627 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 335 transitions. [2023-01-27 18:11:46,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2023-01-27 18:11:46,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:11:46,634 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-01-27 18:11:46,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-01-27 18:11:46,660 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-01-27 18:11:46,661 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-01-27 18:11:46,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:46,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:46,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:46,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:11:46,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:46,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:46,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1617800900, now seen corresponding path program 1 times [2023-01-27 18:11:46,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:46,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338628417] [2023-01-27 18:11:46,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:46,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:47,120 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:47,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:47,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338628417] [2023-01-27 18:11:47,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338628417] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:47,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:47,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:11:47,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66285194] [2023-01-27 18:11:47,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:47,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:11:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:47,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:11:47,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:11:47,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 206 [2023-01-27 18:11:47,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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:47,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:47,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 206 [2023-01-27 18:11:47,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:47,555 INFO L130 PetriNetUnfolder]: 1505/2258 cut-off events. [2023-01-27 18:11:47,556 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2023-01-27 18:11:47,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 2258 events. 1505/2258 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9844 event pairs, 641 based on Foata normal form. 120/2378 useless extension candidates. Maximal degree in co-relation 4704. Up to 1889 conditions per place. [2023-01-27 18:11:47,600 INFO L137 encePairwiseOnDemand]: 200/206 looper letters, 30 selfloop transitions, 4 changer transitions 19/53 dead transitions. [2023-01-27 18:11:47,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 232 flow [2023-01-27 18:11:47,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:11:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:11:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2023-01-27 18:11:47,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48058252427184467 [2023-01-27 18:11:47,618 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 495 transitions. [2023-01-27 18:11:47,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 495 transitions. [2023-01-27 18:11:47,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:47,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 495 transitions. [2023-01-27 18:11:47,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:47,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:47,622 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:47,622 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 495 transitions. [2023-01-27 18:11:47,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 232 flow [2023-01-27 18:11:47,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 53 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:47,624 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 86 flow [2023-01-27 18:11:47,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-01-27 18:11:47,626 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-01-27 18:11:47,626 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 86 flow [2023-01-27 18:11:47,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states 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:47,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:47,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:47,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:11:47,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:47,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:47,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1384361790, now seen corresponding path program 1 times [2023-01-27 18:11:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:47,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710641134] [2023-01-27 18:11:47,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:47,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:48,055 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:48,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:48,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710641134] [2023-01-27 18:11:48,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710641134] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:48,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:48,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:11:48,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234777261] [2023-01-27 18:11:48,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:48,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:48,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:48,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:48,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 206 [2023-01-27 18:11:48,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:48,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:48,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 206 [2023-01-27 18:11:48,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:48,455 INFO L130 PetriNetUnfolder]: 1329/1994 cut-off events. [2023-01-27 18:11:48,466 INFO L131 PetriNetUnfolder]: For 1055/1055 co-relation queries the response was YES. [2023-01-27 18:11:48,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5037 conditions, 1994 events. 1329/1994 cut-off events. For 1055/1055 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8240 event pairs, 371 based on Foata normal form. 96/2090 useless extension candidates. Maximal degree in co-relation 5024. Up to 1301 conditions per place. [2023-01-27 18:11:48,477 INFO L137 encePairwiseOnDemand]: 202/206 looper letters, 31 selfloop transitions, 3 changer transitions 20/54 dead transitions. [2023-01-27 18:11:48,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 282 flow [2023-01-27 18:11:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:11:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:11:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2023-01-27 18:11:48,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4786407766990291 [2023-01-27 18:11:48,479 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2023-01-27 18:11:48,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2023-01-27 18:11:48,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:48,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2023-01-27 18:11:48,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states 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:48,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:48,496 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:48,496 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 86 flow. Second operand 5 states and 493 transitions. [2023-01-27 18:11:48,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 282 flow [2023-01-27 18:11:48,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 276 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:48,519 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 95 flow [2023-01-27 18:11:48,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-01-27 18:11:48,520 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-01-27 18:11:48,522 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 95 flow [2023-01-27 18:11:48,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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:48,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:48,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:48,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:11:48,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:48,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:48,524 INFO L85 PathProgramCache]: Analyzing trace with hash -500729353, now seen corresponding path program 1 times [2023-01-27 18:11:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:48,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939346994] [2023-01-27 18:11:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:48,835 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:48,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:48,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939346994] [2023-01-27 18:11:48,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939346994] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:48,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:48,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:11:48,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436127910] [2023-01-27 18:11:48,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:48,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:11:48,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:48,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:11:48,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:11:48,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-01-27 18:11:48,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:48,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:48,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-01-27 18:11:48,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:49,072 INFO L130 PetriNetUnfolder]: 443/756 cut-off events. [2023-01-27 18:11:49,073 INFO L131 PetriNetUnfolder]: For 398/409 co-relation queries the response was YES. [2023-01-27 18:11:49,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1925 conditions, 756 events. 443/756 cut-off events. For 398/409 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3282 event pairs, 110 based on Foata normal form. 33/771 useless extension candidates. Maximal degree in co-relation 1909. Up to 590 conditions per place. [2023-01-27 18:11:49,077 INFO L137 encePairwiseOnDemand]: 201/206 looper letters, 29 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-01-27 18:11:49,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 195 flow [2023-01-27 18:11:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:11:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:11:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-01-27 18:11:49,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145631067961165 [2023-01-27 18:11:49,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-01-27 18:11:49,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-01-27 18:11:49,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:49,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-01-27 18:11:49,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:49,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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:49,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states 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:49,102 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 95 flow. Second operand 3 states and 318 transitions. [2023-01-27 18:11:49,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 195 flow [2023-01-27 18:11:49,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 185 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:11:49,104 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 111 flow [2023-01-27 18:11:49,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-01-27 18:11:49,104 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-01-27 18:11:49,105 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 111 flow [2023-01-27 18:11:49,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:49,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:49,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:49,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:11:49,105 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:49,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:49,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1735318176, now seen corresponding path program 1 times [2023-01-27 18:11:49,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:49,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825388821] [2023-01-27 18:11:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:49,600 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:49,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:49,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825388821] [2023-01-27 18:11:49,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825388821] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:49,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:49,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:11:49,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575437042] [2023-01-27 18:11:49,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:49,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:11:49,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:49,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:11:49,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:11:49,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-01-27 18:11:49,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states 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:49,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:49,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-01-27 18:11:49,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:49,843 INFO L130 PetriNetUnfolder]: 205/396 cut-off events. [2023-01-27 18:11:49,843 INFO L131 PetriNetUnfolder]: For 158/160 co-relation queries the response was YES. [2023-01-27 18:11:49,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 396 events. 205/396 cut-off events. For 158/160 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1539 event pairs, 60 based on Foata normal form. 35/425 useless extension candidates. Maximal degree in co-relation 1107. Up to 127 conditions per place. [2023-01-27 18:11:49,845 INFO L137 encePairwiseOnDemand]: 201/206 looper letters, 37 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-01-27 18:11:49,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 261 flow [2023-01-27 18:11:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:11:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:11:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2023-01-27 18:11:49,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145631067961165 [2023-01-27 18:11:49,846 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 424 transitions. [2023-01-27 18:11:49,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 424 transitions. [2023-01-27 18:11:49,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:49,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 424 transitions. [2023-01-27 18:11:49,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:11:49,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states 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:49,850 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states 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:49,850 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 111 flow. Second operand 4 states and 424 transitions. [2023-01-27 18:11:49,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 261 flow [2023-01-27 18:11:49,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:11:49,854 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 147 flow [2023-01-27 18:11:49,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-01-27 18:11:49,857 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-01-27 18:11:49,857 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 147 flow [2023-01-27 18:11:49,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states 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:49,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:49,858 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:49,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:11:49,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:49,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2062726237, now seen corresponding path program 1 times [2023-01-27 18:11:49,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:49,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488514924] [2023-01-27 18:11:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:49,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:11:50,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:50,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488514924] [2023-01-27 18:11:50,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488514924] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:50,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:50,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:50,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151129422] [2023-01-27 18:11:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:50,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:50,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:50,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:50,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 206 [2023-01-27 18:11:50,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:50,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:50,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 206 [2023-01-27 18:11:50,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:50,820 INFO L130 PetriNetUnfolder]: 354/653 cut-off events. [2023-01-27 18:11:50,820 INFO L131 PetriNetUnfolder]: For 765/765 co-relation queries the response was YES. [2023-01-27 18:11:50,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 653 events. 354/653 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2699 event pairs, 44 based on Foata normal form. 13/666 useless extension candidates. Maximal degree in co-relation 2076. Up to 408 conditions per place. [2023-01-27 18:11:50,824 INFO L137 encePairwiseOnDemand]: 198/206 looper letters, 66 selfloop transitions, 11 changer transitions 14/91 dead transitions. [2023-01-27 18:11:50,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 91 transitions, 591 flow [2023-01-27 18:11:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:11:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:11:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 679 transitions. [2023-01-27 18:11:50,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470873786407767 [2023-01-27 18:11:50,826 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 679 transitions. [2023-01-27 18:11:50,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 679 transitions. [2023-01-27 18:11:50,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:50,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 679 transitions. [2023-01-27 18:11:50,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states 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:50,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states 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:50,830 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states 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:50,830 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 147 flow. Second operand 7 states and 679 transitions. [2023-01-27 18:11:50,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 91 transitions, 591 flow [2023-01-27 18:11:50,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 91 transitions, 557 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:50,834 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 210 flow [2023-01-27 18:11:50,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-01-27 18:11:50,836 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-01-27 18:11:50,836 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 210 flow [2023-01-27 18:11:50,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:50,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:50,836 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:50,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:11:50,837 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:50,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1313580595, now seen corresponding path program 2 times [2023-01-27 18:11:50,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:50,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159231182] [2023-01-27 18:11:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:50,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:51,310 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:51,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:51,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159231182] [2023-01-27 18:11:51,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159231182] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:51,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:51,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:11:51,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978555804] [2023-01-27 18:11:51,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:51,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:11:51,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:51,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:11:51,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:11:51,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 206 [2023-01-27 18:11:51,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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:51,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:51,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 206 [2023-01-27 18:11:51,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:51,768 INFO L130 PetriNetUnfolder]: 412/764 cut-off events. [2023-01-27 18:11:51,768 INFO L131 PetriNetUnfolder]: For 1481/1481 co-relation queries the response was YES. [2023-01-27 18:11:51,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2754 conditions, 764 events. 412/764 cut-off events. For 1481/1481 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3340 event pairs, 70 based on Foata normal form. 9/773 useless extension candidates. Maximal degree in co-relation 2733. Up to 380 conditions per place. [2023-01-27 18:11:51,772 INFO L137 encePairwiseOnDemand]: 198/206 looper letters, 57 selfloop transitions, 9 changer transitions 25/91 dead transitions. [2023-01-27 18:11:51,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 91 transitions, 641 flow [2023-01-27 18:11:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:11:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:11:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2023-01-27 18:11:51,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47018030513176146 [2023-01-27 18:11:51,774 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2023-01-27 18:11:51,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2023-01-27 18:11:51,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:51,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2023-01-27 18:11:51,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states 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:51,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states 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:51,786 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states 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:51,786 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 210 flow. Second operand 7 states and 678 transitions. [2023-01-27 18:11:51,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 91 transitions, 641 flow [2023-01-27 18:11:51,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 91 transitions, 615 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-01-27 18:11:51,819 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 205 flow [2023-01-27 18:11:51,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2023-01-27 18:11:51,820 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-01-27 18:11:51,820 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 205 flow [2023-01-27 18:11:51,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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:51,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:51,821 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:51,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:11:51,821 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:51,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:51,824 INFO L85 PathProgramCache]: Analyzing trace with hash 258179215, now seen corresponding path program 3 times [2023-01-27 18:11:51,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:51,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026638870] [2023-01-27 18:11:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:51,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:52,319 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:52,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:52,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026638870] [2023-01-27 18:11:52,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026638870] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:52,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:52,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:52,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225620609] [2023-01-27 18:11:52,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:52,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:52,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:52,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:52,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:52,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-01-27 18:11:52,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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:52,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:52,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-01-27 18:11:52,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:52,584 INFO L130 PetriNetUnfolder]: 214/416 cut-off events. [2023-01-27 18:11:52,585 INFO L131 PetriNetUnfolder]: For 731/733 co-relation queries the response was YES. [2023-01-27 18:11:52,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 416 events. 214/416 cut-off events. For 731/733 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1746 event pairs, 64 based on Foata normal form. 19/428 useless extension candidates. Maximal degree in co-relation 1370. Up to 165 conditions per place. [2023-01-27 18:11:52,587 INFO L137 encePairwiseOnDemand]: 201/206 looper letters, 28 selfloop transitions, 10 changer transitions 10/53 dead transitions. [2023-01-27 18:11:52,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 359 flow [2023-01-27 18:11:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:11:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:11:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-01-27 18:11:52,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503883495145631 [2023-01-27 18:11:52,588 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-01-27 18:11:52,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-01-27 18:11:52,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:52,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-01-27 18:11:52,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:52,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:52,591 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:52,591 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 205 flow. Second operand 5 states and 519 transitions. [2023-01-27 18:11:52,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 359 flow [2023-01-27 18:11:52,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 316 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-01-27 18:11:52,593 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 162 flow [2023-01-27 18:11:52,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-01-27 18:11:52,594 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-01-27 18:11:52,594 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 162 flow [2023-01-27 18:11:52,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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:52,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:52,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:52,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:11:52,595 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:52,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash -206311797, now seen corresponding path program 1 times [2023-01-27 18:11:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:52,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391293713] [2023-01-27 18:11:52,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:53,380 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:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391293713] [2023-01-27 18:11:53,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391293713] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:53,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:53,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:11:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534536674] [2023-01-27 18:11:53,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:53,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:11:53,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:53,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:11:53,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:11:53,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 206 [2023-01-27 18:11:53,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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:53,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:53,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 206 [2023-01-27 18:11:53,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:53,753 INFO L130 PetriNetUnfolder]: 192/410 cut-off events. [2023-01-27 18:11:53,754 INFO L131 PetriNetUnfolder]: For 862/870 co-relation queries the response was YES. [2023-01-27 18:11:53,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 410 events. 192/410 cut-off events. For 862/870 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1841 event pairs, 16 based on Foata normal form. 2/406 useless extension candidates. Maximal degree in co-relation 1476. Up to 151 conditions per place. [2023-01-27 18:11:53,756 INFO L137 encePairwiseOnDemand]: 198/206 looper letters, 52 selfloop transitions, 7 changer transitions 31/95 dead transitions. [2023-01-27 18:11:53,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 733 flow [2023-01-27 18:11:53,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:11:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:11:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 775 transitions. [2023-01-27 18:11:53,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702669902912621 [2023-01-27 18:11:53,758 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 775 transitions. [2023-01-27 18:11:53,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 775 transitions. [2023-01-27 18:11:53,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:53,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 775 transitions. [2023-01-27 18:11:53,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.875) internal successors, (775), 8 states have internal predecessors, (775), 0 states have call successors, (0), 0 states 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:53,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states 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:53,761 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states 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:53,761 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 162 flow. Second operand 8 states and 775 transitions. [2023-01-27 18:11:53,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 733 flow [2023-01-27 18:11:53,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 607 flow, removed 32 selfloop flow, removed 4 redundant places. [2023-01-27 18:11:53,765 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 183 flow [2023-01-27 18:11:53,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=183, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2023-01-27 18:11:53,766 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2023-01-27 18:11:53,766 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 183 flow [2023-01-27 18:11:53,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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:53,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:53,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:53,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:11:53,766 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:53,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1699849807, now seen corresponding path program 2 times [2023-01-27 18:11:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:53,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886707937] [2023-01-27 18:11:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:54,167 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:54,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:54,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886707937] [2023-01-27 18:11:54,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886707937] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:54,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:54,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:11:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680826114] [2023-01-27 18:11:54,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:54,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:11:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:54,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:11:54,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:11:54,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 206 [2023-01-27 18:11:54,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states 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:54,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:54,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 206 [2023-01-27 18:11:54,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:54,410 INFO L130 PetriNetUnfolder]: 222/474 cut-off events. [2023-01-27 18:11:54,410 INFO L131 PetriNetUnfolder]: For 875/875 co-relation queries the response was YES. [2023-01-27 18:11:54,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 474 events. 222/474 cut-off events. For 875/875 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2257 event pairs, 70 based on Foata normal form. 1/472 useless extension candidates. Maximal degree in co-relation 1769. Up to 195 conditions per place. [2023-01-27 18:11:54,412 INFO L137 encePairwiseOnDemand]: 202/206 looper letters, 31 selfloop transitions, 1 changer transitions 31/65 dead transitions. [2023-01-27 18:11:54,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 483 flow [2023-01-27 18:11:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:11:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:11:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2023-01-27 18:11:54,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4786407766990291 [2023-01-27 18:11:54,414 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2023-01-27 18:11:54,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2023-01-27 18:11:54,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:54,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2023-01-27 18:11:54,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states 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:54,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:54,417 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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:54,417 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 183 flow. Second operand 5 states and 493 transitions. [2023-01-27 18:11:54,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 483 flow [2023-01-27 18:11:54,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 445 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-01-27 18:11:54,421 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 158 flow [2023-01-27 18:11:54,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2023-01-27 18:11:54,422 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-01-27 18:11:54,422 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 158 flow [2023-01-27 18:11:54,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states 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:54,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:54,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:54,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:11:54,423 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:54,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1198766533, now seen corresponding path program 3 times [2023-01-27 18:11:54,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:54,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230125380] [2023-01-27 18:11:54,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:11:56,220 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:56,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:11:56,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230125380] [2023-01-27 18:11:56,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230125380] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:11:56,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:11:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 18:11:56,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263184447] [2023-01-27 18:11:56,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:11:56,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 18:11:56,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:11:56,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 18:11:56,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-27 18:11:56,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 206 [2023-01-27 18:11:56,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 158 flow. Second operand has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states 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:56,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:11:56,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 206 [2023-01-27 18:11:56,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:11:56,777 INFO L130 PetriNetUnfolder]: 95/206 cut-off events. [2023-01-27 18:11:56,777 INFO L131 PetriNetUnfolder]: For 309/318 co-relation queries the response was YES. [2023-01-27 18:11:56,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 206 events. 95/206 cut-off events. For 309/318 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 668 event pairs, 19 based on Foata normal form. 8/212 useless extension candidates. Maximal degree in co-relation 719. Up to 92 conditions per place. [2023-01-27 18:11:56,778 INFO L137 encePairwiseOnDemand]: 200/206 looper letters, 26 selfloop transitions, 4 changer transitions 28/61 dead transitions. [2023-01-27 18:11:56,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 418 flow [2023-01-27 18:11:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:11:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:11:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 659 transitions. [2023-01-27 18:11:56,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45700416088765605 [2023-01-27 18:11:56,780 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 659 transitions. [2023-01-27 18:11:56,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 659 transitions. [2023-01-27 18:11:56,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:11:56,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 659 transitions. [2023-01-27 18:11:56,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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:56,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states 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:56,783 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states 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:56,783 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 158 flow. Second operand 7 states and 659 transitions. [2023-01-27 18:11:56,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 418 flow [2023-01-27 18:11:56,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 402 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-01-27 18:11:56,786 INFO L231 Difference]: Finished difference. Result has 54 places, 30 transitions, 156 flow [2023-01-27 18:11:56,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=30} [2023-01-27 18:11:56,786 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2023-01-27 18:11:56,786 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 30 transitions, 156 flow [2023-01-27 18:11:56,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 0 states 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:56,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:11:56,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:11:56,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:11:56,787 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:11:56,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:11:56,787 INFO L85 PathProgramCache]: Analyzing trace with hash 734856249, now seen corresponding path program 4 times [2023-01-27 18:11:56,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:11:56,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135945978] [2023-01-27 18:11:56,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:11:56,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:11:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:11:56,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:11:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:11:57,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:11:57,185 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:11:57,186 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:11:57,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:11:57,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:11:57,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:11:57,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:11:57,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:11:57,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:11:57,188 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2023-01-27 18:11:57,192 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:11:57,193 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:11:57,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:11:57 BasicIcfg [2023-01-27 18:11:57,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:11:57,342 INFO L158 Benchmark]: Toolchain (without parser) took 23279.32ms. Allocated memory was 499.1MB in the beginning and 721.4MB in the end (delta: 222.3MB). Free memory was 447.2MB in the beginning and 654.3MB in the end (delta: -207.1MB). Peak memory consumption was 15.5MB. Max. memory is 16.0GB. [2023-01-27 18:11:57,342 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 310.4MB. Free memory is still 259.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:11:57,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.76ms. Allocated memory is still 499.1MB. Free memory was 447.2MB in the beginning and 424.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:11:57,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.67ms. Allocated memory is still 499.1MB. Free memory was 424.2MB in the beginning and 421.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:11:57,343 INFO L158 Benchmark]: Boogie Preprocessor took 86.19ms. Allocated memory is still 499.1MB. Free memory was 421.7MB in the beginning and 420.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:11:57,343 INFO L158 Benchmark]: RCFGBuilder took 778.45ms. Allocated memory is still 499.1MB. Free memory was 420.0MB in the beginning and 445.8MB in the end (delta: -25.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.0GB. [2023-01-27 18:11:57,343 INFO L158 Benchmark]: TraceAbstraction took 21637.50ms. Allocated memory was 499.1MB in the beginning and 721.4MB in the end (delta: 222.3MB). Free memory was 444.8MB in the beginning and 654.3MB in the end (delta: -209.5MB). Peak memory consumption was 11.7MB. Max. memory is 16.0GB. [2023-01-27 18:11:57,344 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.18ms. Allocated memory is still 310.4MB. Free memory is still 259.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 702.76ms. Allocated memory is still 499.1MB. Free memory was 447.2MB in the beginning and 424.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.67ms. Allocated memory is still 499.1MB. Free memory was 424.2MB in the beginning and 421.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 86.19ms. Allocated memory is still 499.1MB. Free memory was 421.7MB in the beginning and 420.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 778.45ms. Allocated memory is still 499.1MB. Free memory was 420.0MB in the beginning and 445.8MB in the end (delta: -25.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.0GB. * TraceAbstraction took 21637.50ms. Allocated memory was 499.1MB in the beginning and 721.4MB in the end (delta: 222.3MB). Free memory was 444.8MB in the beginning and 654.3MB in the end (delta: -209.5MB). Peak memory consumption was 11.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2s, 117 PlacesBefore, 35 PlacesAfterwards, 109 TransitionsBefore, 26 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 5282 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2259, independent: 2072, independent conditional: 0, independent unconditional: 2072, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1044, independent: 1011, independent conditional: 0, independent unconditional: 1011, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2259, independent: 1061, independent conditional: 0, independent unconditional: 1061, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 1044, unknown conditional: 0, unknown unconditional: 1044] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916, ((void *)0), P0, ((void *)0))=-3, t916={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917, ((void *)0), P1, ((void *)0))=-2, t916={5:0}, t917={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t918, ((void *)0), P2, ((void *)0))=-1, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L807] 3 y = 1 [L810] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 19]: 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: 844]: 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: 842]: 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, 140 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: 21.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1115 IncrementalHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 26 mSDtfsCounter, 1115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 1213 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:57,407 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...