/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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:17:12,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:17:12,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:17:12,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:17:12,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:17:12,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:17:12,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:17:12,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:17:12,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:17:12,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:17:12,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:17:12,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:17:12,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:17:12,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:17:12,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:17:12,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:17:12,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:17:12,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:17:12,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:17:12,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:17:12,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:17:12,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:17:12,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:17:12,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:17:12,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:17:12,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:17:12,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:17:12,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:17:12,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:17:12,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:17:12,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:17:12,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:17:12,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:17:12,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:17:12,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:17:12,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:17:12,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:17:12,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:17:12,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:17:12,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:17:12,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:17:12,857 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:17:12,875 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:17:12,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:17:12,876 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:17:12,876 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:17:12,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:17:12,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:17:12,877 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:17:12,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:17:12,877 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:17:12,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:17:12,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:17:12,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:17:12,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:17:12,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:17:12,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:17:12,878 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:17:12,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:17:12,878 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:17:12,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:17:12,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:17:12,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:17:12,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:17:12,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:17:12,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:17:12,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:17:12,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:17:12,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:17:12,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:17:12,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:17:12,880 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:17:12,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:17:12,880 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:17:13,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:17:13,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:17:13,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:17:13,109 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:17:13,110 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:17:13,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-27 18:17:14,237 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:17:14,521 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:17:14,522 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-27 18:17:14,533 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d51d43c/6310cb8bbd4545b8aa650d19f396b907/FLAG3adae1cc0 [2023-01-27 18:17:14,554 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d51d43c/6310cb8bbd4545b8aa650d19f396b907 [2023-01-27 18:17:14,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:17:14,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:17:14,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:17:14,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:17:14,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:17:14,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:17:14" (1/1) ... [2023-01-27 18:17:14,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119a87ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:14, skipping insertion in model container [2023-01-27 18:17:14,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:17:14" (1/1) ... [2023-01-27 18:17:14,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:17:14,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:17:14,750 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-01-27 18:17:14,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:17:14,952 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:17:14,965 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-01-27 18:17:15,020 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:17:15,045 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:17:15,045 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:17:15,051 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:17:15,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:15 WrapperNode [2023-01-27 18:17:15,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:17:15,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:17:15,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:17:15,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:17:15,061 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:17:15" (1/1) ... [2023-01-27 18:17:15,093 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:17:15" (1/1) ... [2023-01-27 18:17:15,142 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-01-27 18:17:15,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:17:15,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:17:15,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:17:15,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:17:15,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:15" (1/1) ... [2023-01-27 18:17:15,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:15" (1/1) ... [2023-01-27 18:17:15,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:15" (1/1) ... [2023-01-27 18:17:15,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:15" (1/1) ... [2023-01-27 18:17:15,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:15" (1/1) ... [2023-01-27 18:17:15,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:15" (1/1) ... [2023-01-27 18:17:15,205 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:15" (1/1) ... [2023-01-27 18:17:15,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:15" (1/1) ... [2023-01-27 18:17:15,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:17:15,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:17:15,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:17:15,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:17:15,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:15" (1/1) ... [2023-01-27 18:17:15,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:17:15,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:17:15,254 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:17:15,277 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:17:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:17:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:17:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:17:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:17:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:17:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:17:15,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:17:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:17:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:17:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:17:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:17:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:17:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:17:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:17:15,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:17:15,295 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:17:15,477 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:17:15,478 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:17:15,765 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:17:15,960 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:17:15,960 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:17:15,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:17:15 BoogieIcfgContainer [2023-01-27 18:17:15,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:17:15,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:17:15,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:17:15,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:17:15,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:17:14" (1/3) ... [2023-01-27 18:17:15,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ba024f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:17:15, skipping insertion in model container [2023-01-27 18:17:15,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:17:15" (2/3) ... [2023-01-27 18:17:15,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ba024f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:17:15, skipping insertion in model container [2023-01-27 18:17:15,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:17:15" (3/3) ... [2023-01-27 18:17:15,969 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-01-27 18:17:15,984 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:17:15,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:17:15,985 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:17:16,056 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:17:16,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-01-27 18:17:16,146 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-27 18:17:16,147 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:17:16,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-27 18:17:16,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-01-27 18:17:16,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-01-27 18:17:16,178 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:17:16,197 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-27 18:17:16,199 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-01-27 18:17:16,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-01-27 18:17:16,223 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2023-01-27 18:17:16,224 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:17:16,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-27 18:17:16,226 INFO L119 LiptonReduction]: Number of co-enabled transitions 1790 [2023-01-27 18:17:19,564 INFO L134 LiptonReduction]: Checked pairs total: 4444 [2023-01-27 18:17:19,564 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-01-27 18:17:19,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:17:19,582 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;@3b244eaf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:17:19,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:17:19,586 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-27 18:17:19,586 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:17:19,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:19,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:17:19,587 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:17:19,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash 442810825, now seen corresponding path program 1 times [2023-01-27 18:17:19,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:19,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755266614] [2023-01-27 18:17:19,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:19,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:19,926 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:17:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:19,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755266614] [2023-01-27 18:17:19,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755266614] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:19,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:19,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:17:19,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239573510] [2023-01-27 18:17:19,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:19,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:17:19,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:19,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:17:19,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:17:19,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 203 [2023-01-27 18:17:19,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:17:19,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:19,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 203 [2023-01-27 18:17:19,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:20,157 INFO L130 PetriNetUnfolder]: 711/1164 cut-off events. [2023-01-27 18:17:20,158 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-27 18:17:20,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1164 events. 711/1164 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5719 event pairs, 117 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 2272. Up to 859 conditions per place. [2023-01-27 18:17:20,167 INFO L137 encePairwiseOnDemand]: 199/203 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-01-27 18:17:20,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 140 flow [2023-01-27 18:17:20,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:17:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:17:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-01-27 18:17:20,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188834154351396 [2023-01-27 18:17:20,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-01-27 18:17:20,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-01-27 18:17:20,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:20,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-01-27 18:17:20,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:20,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states 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:17:20,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states 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:17:20,193 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 316 transitions. [2023-01-27 18:17:20,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 140 flow [2023-01-27 18:17:20,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:17:20,197 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-01-27 18:17:20,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-01-27 18:17:20,216 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-01-27 18:17:20,216 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-01-27 18:17:20,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:17:20,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:20,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:20,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:17:20,217 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:17:20,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:20,218 INFO L85 PathProgramCache]: Analyzing trace with hash -165871513, now seen corresponding path program 1 times [2023-01-27 18:17:20,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:20,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116410675] [2023-01-27 18:17:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:20,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:20,556 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:17:20,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:20,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116410675] [2023-01-27 18:17:20,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116410675] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:20,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:20,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:17:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258184541] [2023-01-27 18:17:20,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:20,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:17:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:20,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:17:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:17:20,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 203 [2023-01-27 18:17:20,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:17:20,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:20,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 203 [2023-01-27 18:17:20,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:20,816 INFO L130 PetriNetUnfolder]: 1346/2064 cut-off events. [2023-01-27 18:17:20,816 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-01-27 18:17:20,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 2064 events. 1346/2064 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10016 event pairs, 502 based on Foata normal form. 94/2158 useless extension candidates. Maximal degree in co-relation 4321. Up to 1076 conditions per place. [2023-01-27 18:17:20,827 INFO L137 encePairwiseOnDemand]: 196/203 looper letters, 30 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2023-01-27 18:17:20,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 160 flow [2023-01-27 18:17:20,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:17:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:17:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-01-27 18:17:20,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48440065681444994 [2023-01-27 18:17:20,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-01-27 18:17:20,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-01-27 18:17:20,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:20,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-01-27 18:17:20,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states 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:17:20,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states 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:17:20,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states 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:17:20,834 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 295 transitions. [2023-01-27 18:17:20,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 160 flow [2023-01-27 18:17:20,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:20,836 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 88 flow [2023-01-27 18:17:20,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-01-27 18:17:20,836 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-01-27 18:17:20,837 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 88 flow [2023-01-27 18:17:20,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:17:20,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:20,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:20,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:17:20,838 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:17:20,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:20,838 INFO L85 PathProgramCache]: Analyzing trace with hash -847050852, now seen corresponding path program 1 times [2023-01-27 18:17:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:20,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31627990] [2023-01-27 18:17:20,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:20,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:21,052 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:17:21,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:21,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31627990] [2023-01-27 18:17:21,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31627990] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:21,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:21,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:17:21,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203444413] [2023-01-27 18:17:21,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:21,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:17:21,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:21,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:17:21,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:17:21,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 203 [2023-01-27 18:17:21,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:21,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:21,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 203 [2023-01-27 18:17:21,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:21,318 INFO L130 PetriNetUnfolder]: 1287/1975 cut-off events. [2023-01-27 18:17:21,320 INFO L131 PetriNetUnfolder]: For 758/758 co-relation queries the response was YES. [2023-01-27 18:17:21,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 1975 events. 1287/1975 cut-off events. For 758/758 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8960 event pairs, 210 based on Foata normal form. 15/1990 useless extension candidates. Maximal degree in co-relation 5048. Up to 886 conditions per place. [2023-01-27 18:17:21,334 INFO L137 encePairwiseOnDemand]: 196/203 looper letters, 33 selfloop transitions, 7 changer transitions 3/43 dead transitions. [2023-01-27 18:17:21,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 43 transitions, 228 flow [2023-01-27 18:17:21,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:17:21,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:17:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 385 transitions. [2023-01-27 18:17:21,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47413793103448276 [2023-01-27 18:17:21,337 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 385 transitions. [2023-01-27 18:17:21,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 385 transitions. [2023-01-27 18:17:21,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:21,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 385 transitions. [2023-01-27 18:17:21,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:17:21,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states 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:17:21,342 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states 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:17:21,342 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 88 flow. Second operand 4 states and 385 transitions. [2023-01-27 18:17:21,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 43 transitions, 228 flow [2023-01-27 18:17:21,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:21,349 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 118 flow [2023-01-27 18:17:21,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-01-27 18:17:21,351 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-01-27 18:17:21,353 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 118 flow [2023-01-27 18:17:21,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:21,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:21,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:21,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:17:21,355 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:17:21,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:21,355 INFO L85 PathProgramCache]: Analyzing trace with hash -488772920, now seen corresponding path program 1 times [2023-01-27 18:17:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:21,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691671500] [2023-01-27 18:17:21,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:21,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:21,583 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:17:21,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:21,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691671500] [2023-01-27 18:17:21,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691671500] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:21,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:21,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:17:21,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852061106] [2023-01-27 18:17:21,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:21,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:17:21,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:21,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:17:21,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:17:21,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 203 [2023-01-27 18:17:21,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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:17:21,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:21,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 203 [2023-01-27 18:17:21,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:21,937 INFO L130 PetriNetUnfolder]: 1199/1845 cut-off events. [2023-01-27 18:17:21,938 INFO L131 PetriNetUnfolder]: For 1649/1649 co-relation queries the response was YES. [2023-01-27 18:17:21,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5074 conditions, 1845 events. 1199/1845 cut-off events. For 1649/1649 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8214 event pairs, 377 based on Foata normal form. 15/1860 useless extension candidates. Maximal degree in co-relation 5059. Up to 648 conditions per place. [2023-01-27 18:17:21,948 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 36 selfloop transitions, 6 changer transitions 3/45 dead transitions. [2023-01-27 18:17:21,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 268 flow [2023-01-27 18:17:21,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:17:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:17:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 384 transitions. [2023-01-27 18:17:21,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4729064039408867 [2023-01-27 18:17:21,951 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 384 transitions. [2023-01-27 18:17:21,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 384 transitions. [2023-01-27 18:17:21,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:21,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 384 transitions. [2023-01-27 18:17:21,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:17:21,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states 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:17:21,962 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states 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:17:21,962 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 118 flow. Second operand 4 states and 384 transitions. [2023-01-27 18:17:21,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 268 flow [2023-01-27 18:17:21,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:17:21,967 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 161 flow [2023-01-27 18:17:21,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-01-27 18:17:21,968 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-01-27 18:17:21,969 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 161 flow [2023-01-27 18:17:21,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 4 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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:17:21,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:21,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:21,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:17:21,969 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:17:21,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:21,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1680205126, now seen corresponding path program 1 times [2023-01-27 18:17:21,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:21,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615863389] [2023-01-27 18:17:21,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:22,163 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:17:22,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:22,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615863389] [2023-01-27 18:17:22,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615863389] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:22,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:22,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:17:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197859817] [2023-01-27 18:17:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:22,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:22,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:22,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 203 [2023-01-27 18:17:22,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:22,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:22,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 203 [2023-01-27 18:17:22,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:22,554 INFO L130 PetriNetUnfolder]: 1546/2402 cut-off events. [2023-01-27 18:17:22,554 INFO L131 PetriNetUnfolder]: For 3474/3474 co-relation queries the response was YES. [2023-01-27 18:17:22,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6999 conditions, 2402 events. 1546/2402 cut-off events. For 3474/3474 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12083 event pairs, 242 based on Foata normal form. 45/2447 useless extension candidates. Maximal degree in co-relation 6980. Up to 1305 conditions per place. [2023-01-27 18:17:22,569 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 44 selfloop transitions, 9 changer transitions 11/64 dead transitions. [2023-01-27 18:17:22,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 64 transitions, 434 flow [2023-01-27 18:17:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:17:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:17:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2023-01-27 18:17:22,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47783251231527096 [2023-01-27 18:17:22,571 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 485 transitions. [2023-01-27 18:17:22,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 485 transitions. [2023-01-27 18:17:22,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:22,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 485 transitions. [2023-01-27 18:17:22,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states 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:17:22,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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:17:22,576 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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:17:22,576 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 161 flow. Second operand 5 states and 485 transitions. [2023-01-27 18:17:22,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 64 transitions, 434 flow [2023-01-27 18:17:22,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 64 transitions, 424 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:22,588 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 208 flow [2023-01-27 18:17:22,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-01-27 18:17:22,589 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-01-27 18:17:22,589 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 208 flow [2023-01-27 18:17:22,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:22,590 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:22,590 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:22,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:17:22,590 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:17:22,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1560317516, now seen corresponding path program 1 times [2023-01-27 18:17:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138873330] [2023-01-27 18:17:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:22,805 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:17:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:22,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138873330] [2023-01-27 18:17:22,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138873330] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:22,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:22,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:17:22,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364860704] [2023-01-27 18:17:22,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:22,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:22,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:22,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:22,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 203 [2023-01-27 18:17:22,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:17:22,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:22,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 203 [2023-01-27 18:17:22,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:23,296 INFO L130 PetriNetUnfolder]: 1996/3140 cut-off events. [2023-01-27 18:17:23,297 INFO L131 PetriNetUnfolder]: For 5340/5340 co-relation queries the response was YES. [2023-01-27 18:17:23,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9309 conditions, 3140 events. 1996/3140 cut-off events. For 5340/5340 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16837 event pairs, 356 based on Foata normal form. 48/3188 useless extension candidates. Maximal degree in co-relation 9288. Up to 797 conditions per place. [2023-01-27 18:17:23,311 INFO L137 encePairwiseOnDemand]: 196/203 looper letters, 44 selfloop transitions, 13 changer transitions 24/81 dead transitions. [2023-01-27 18:17:23,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 548 flow [2023-01-27 18:17:23,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:17:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:17:23,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 678 transitions. [2023-01-27 18:17:23,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47712878254750174 [2023-01-27 18:17:23,313 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 678 transitions. [2023-01-27 18:17:23,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 678 transitions. [2023-01-27 18:17:23,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:23,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 678 transitions. [2023-01-27 18:17:23,315 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:17:23,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:17:23,318 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:17:23,318 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 208 flow. Second operand 7 states and 678 transitions. [2023-01-27 18:17:23,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 548 flow [2023-01-27 18:17:23,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 516 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-27 18:17:23,329 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 229 flow [2023-01-27 18:17:23,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=229, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2023-01-27 18:17:23,330 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2023-01-27 18:17:23,330 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 229 flow [2023-01-27 18:17:23,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:17:23,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:23,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:23,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:17:23,331 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:17:23,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash 547988032, now seen corresponding path program 2 times [2023-01-27 18:17:23,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:23,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862494827] [2023-01-27 18:17:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:23,513 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:17:23,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:23,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862494827] [2023-01-27 18:17:23,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862494827] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:23,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:23,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:17:23,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226923101] [2023-01-27 18:17:23,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:23,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:23,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:23,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:23,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 203 [2023-01-27 18:17:23,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:17:23,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:23,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 203 [2023-01-27 18:17:23,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:23,926 INFO L130 PetriNetUnfolder]: 1772/2796 cut-off events. [2023-01-27 18:17:23,927 INFO L131 PetriNetUnfolder]: For 6387/6387 co-relation queries the response was YES. [2023-01-27 18:17:23,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8285 conditions, 2796 events. 1772/2796 cut-off events. For 6387/6387 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14915 event pairs, 482 based on Foata normal form. 57/2853 useless extension candidates. Maximal degree in co-relation 8261. Up to 1584 conditions per place. [2023-01-27 18:17:23,939 INFO L137 encePairwiseOnDemand]: 196/203 looper letters, 35 selfloop transitions, 9 changer transitions 16/60 dead transitions. [2023-01-27 18:17:23,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 484 flow [2023-01-27 18:17:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:17:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:17:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2023-01-27 18:17:23,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4729064039408867 [2023-01-27 18:17:23,941 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 480 transitions. [2023-01-27 18:17:23,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 480 transitions. [2023-01-27 18:17:23,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:23,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 480 transitions. [2023-01-27 18:17:23,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:17:23,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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:17:23,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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:17:23,945 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 229 flow. Second operand 5 states and 480 transitions. [2023-01-27 18:17:23,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 484 flow [2023-01-27 18:17:23,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 472 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:23,958 INFO L231 Difference]: Finished difference. Result has 51 places, 27 transitions, 199 flow [2023-01-27 18:17:23,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=51, PETRI_TRANSITIONS=27} [2023-01-27 18:17:23,959 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2023-01-27 18:17:23,959 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 27 transitions, 199 flow [2023-01-27 18:17:23,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:17:23,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:23,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:23,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:17:23,960 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:17:23,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:23,961 INFO L85 PathProgramCache]: Analyzing trace with hash -95210611, now seen corresponding path program 1 times [2023-01-27 18:17:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118235445] [2023-01-27 18:17:23,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:23,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:24,286 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:17:24,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:24,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118235445] [2023-01-27 18:17:24,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118235445] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:24,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:24,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:17:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169835580] [2023-01-27 18:17:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:24,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:17:24,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:17:24,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:17:24,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-01-27 18:17:24,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 27 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:17:24,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:24,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-01-27 18:17:24,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:24,499 INFO L130 PetriNetUnfolder]: 656/1153 cut-off events. [2023-01-27 18:17:24,499 INFO L131 PetriNetUnfolder]: For 3205/3220 co-relation queries the response was YES. [2023-01-27 18:17:24,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3463 conditions, 1153 events. 656/1153 cut-off events. For 3205/3220 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6220 event pairs, 120 based on Foata normal form. 129/1275 useless extension candidates. Maximal degree in co-relation 3438. Up to 494 conditions per place. [2023-01-27 18:17:24,510 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 42 selfloop transitions, 5 changer transitions 5/56 dead transitions. [2023-01-27 18:17:24,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 497 flow [2023-01-27 18:17:24,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:17:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:17:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions. [2023-01-27 18:17:24,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48645320197044334 [2023-01-27 18:17:24,512 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 395 transitions. [2023-01-27 18:17:24,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 395 transitions. [2023-01-27 18:17:24,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:24,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 395 transitions. [2023-01-27 18:17:24,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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:17:24,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states 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:17:24,515 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states 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:17:24,515 INFO L175 Difference]: Start difference. First operand has 51 places, 27 transitions, 199 flow. Second operand 4 states and 395 transitions. [2023-01-27 18:17:24,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 497 flow [2023-01-27 18:17:24,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 393 flow, removed 7 selfloop flow, removed 9 redundant places. [2023-01-27 18:17:24,520 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 181 flow [2023-01-27 18:17:24,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-01-27 18:17:24,523 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2023-01-27 18:17:24,523 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 181 flow [2023-01-27 18:17:24,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:17:24,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:24,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:24,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:17:24,524 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:17:24,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:24,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1009066726, now seen corresponding path program 1 times [2023-01-27 18:17:24,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:24,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246120166] [2023-01-27 18:17:24,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:24,861 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:17:24,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246120166] [2023-01-27 18:17:24,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246120166] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:24,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:24,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:17:24,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634092503] [2023-01-27 18:17:24,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:24,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:24,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:24,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:24,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:24,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-01-27 18:17:24,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states 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:17:24,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:24,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-01-27 18:17:24,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:25,039 INFO L130 PetriNetUnfolder]: 342/668 cut-off events. [2023-01-27 18:17:25,039 INFO L131 PetriNetUnfolder]: For 1021/1025 co-relation queries the response was YES. [2023-01-27 18:17:25,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2300 conditions, 668 events. 342/668 cut-off events. For 1021/1025 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3417 event pairs, 48 based on Foata normal form. 84/747 useless extension candidates. Maximal degree in co-relation 2278. Up to 254 conditions per place. [2023-01-27 18:17:25,043 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 46 selfloop transitions, 8 changer transitions 8/66 dead transitions. [2023-01-27 18:17:25,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 502 flow [2023-01-27 18:17:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:17:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:17:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-01-27 18:17:25,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48472906403940885 [2023-01-27 18:17:25,045 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-01-27 18:17:25,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-01-27 18:17:25,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:25,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-01-27 18:17:25,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:17:25,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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:17:25,048 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states 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:17:25,049 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 181 flow. Second operand 5 states and 492 transitions. [2023-01-27 18:17:25,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 502 flow [2023-01-27 18:17:25,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 484 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 18:17:25,052 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 216 flow [2023-01-27 18:17:25,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2023-01-27 18:17:25,052 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2023-01-27 18:17:25,052 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 216 flow [2023-01-27 18:17:25,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states 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:17:25,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:25,053 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:17:25,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:17:25,053 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:17:25,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:25,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1107504044, now seen corresponding path program 1 times [2023-01-27 18:17:25,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:25,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272190313] [2023-01-27 18:17:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:25,453 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:17:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:25,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272190313] [2023-01-27 18:17:25,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272190313] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:25,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:25,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:17:25,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052969850] [2023-01-27 18:17:25,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:25,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:17:25,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:25,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:17:25,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:17:25,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 203 [2023-01-27 18:17:25,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 0 states have call successors, (0), 0 states 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:17:25,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:25,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 203 [2023-01-27 18:17:25,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:25,705 INFO L130 PetriNetUnfolder]: 366/727 cut-off events. [2023-01-27 18:17:25,705 INFO L131 PetriNetUnfolder]: For 1677/1677 co-relation queries the response was YES. [2023-01-27 18:17:25,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 727 events. 366/727 cut-off events. For 1677/1677 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3544 event pairs, 52 based on Foata normal form. 10/737 useless extension candidates. Maximal degree in co-relation 2905. Up to 310 conditions per place. [2023-01-27 18:17:25,709 INFO L137 encePairwiseOnDemand]: 193/203 looper letters, 45 selfloop transitions, 24 changer transitions 22/91 dead transitions. [2023-01-27 18:17:25,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 91 transitions, 760 flow [2023-01-27 18:17:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:17:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:17:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 642 transitions. [2023-01-27 18:17:25,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4517945109078114 [2023-01-27 18:17:25,712 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 642 transitions. [2023-01-27 18:17:25,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 642 transitions. [2023-01-27 18:17:25,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:25,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 642 transitions. [2023-01-27 18:17:25,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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:17:25,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:17:25,717 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:17:25,717 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 216 flow. Second operand 7 states and 642 transitions. [2023-01-27 18:17:25,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 91 transitions, 760 flow [2023-01-27 18:17:25,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 91 transitions, 697 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-01-27 18:17:25,722 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 383 flow [2023-01-27 18:17:25,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-01-27 18:17:25,723 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2023-01-27 18:17:25,723 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 383 flow [2023-01-27 18:17:25,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 0 states have call successors, (0), 0 states 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:17:25,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:25,724 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:17:25,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:17:25,724 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:17:25,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1833317115, now seen corresponding path program 1 times [2023-01-27 18:17:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:25,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303493885] [2023-01-27 18:17:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:26,042 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:17:26,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:26,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303493885] [2023-01-27 18:17:26,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303493885] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:26,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:26,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:17:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168227023] [2023-01-27 18:17:26,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:26,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:17:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:17:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:17:26,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-01-27 18:17:26,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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:17:26,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:26,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-01-27 18:17:26,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:26,192 INFO L130 PetriNetUnfolder]: 175/379 cut-off events. [2023-01-27 18:17:26,192 INFO L131 PetriNetUnfolder]: For 1072/1077 co-relation queries the response was YES. [2023-01-27 18:17:26,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 379 events. 175/379 cut-off events. For 1072/1077 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1683 event pairs, 25 based on Foata normal form. 25/400 useless extension candidates. Maximal degree in co-relation 1566. Up to 135 conditions per place. [2023-01-27 18:17:26,194 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 51 selfloop transitions, 11 changer transitions 10/77 dead transitions. [2023-01-27 18:17:26,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 738 flow [2023-01-27 18:17:26,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:17:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:17:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 572 transitions. [2023-01-27 18:17:26,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696223316912972 [2023-01-27 18:17:26,197 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 572 transitions. [2023-01-27 18:17:26,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 572 transitions. [2023-01-27 18:17:26,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:26,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 572 transitions. [2023-01-27 18:17:26,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states 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:17:26,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states 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:17:26,200 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states 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:17:26,201 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 383 flow. Second operand 6 states and 572 transitions. [2023-01-27 18:17:26,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 738 flow [2023-01-27 18:17:26,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 709 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-27 18:17:26,204 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 396 flow [2023-01-27 18:17:26,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=396, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-01-27 18:17:26,205 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2023-01-27 18:17:26,205 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 396 flow [2023-01-27 18:17:26,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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:17:26,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:26,206 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] [2023-01-27 18:17:26,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:17:26,206 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:17:26,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash -494564831, now seen corresponding path program 1 times [2023-01-27 18:17:26,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:26,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824974937] [2023-01-27 18:17:26,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:26,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:17:26,849 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:17:26,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:17:26,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824974937] [2023-01-27 18:17:26,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824974937] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:17:26,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:17:26,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:17:26,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332957525] [2023-01-27 18:17:26,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:17:26,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:17:26,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:17:26,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:17:26,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:17:26,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 203 [2023-01-27 18:17:26,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 396 flow. Second operand has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 0 states have call successors, (0), 0 states 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:17:26,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:17:26,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 203 [2023-01-27 18:17:26,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:17:27,016 INFO L130 PetriNetUnfolder]: 167/372 cut-off events. [2023-01-27 18:17:27,016 INFO L131 PetriNetUnfolder]: For 1320/1333 co-relation queries the response was YES. [2023-01-27 18:17:27,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 372 events. 167/372 cut-off events. For 1320/1333 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1609 event pairs, 23 based on Foata normal form. 13/385 useless extension candidates. Maximal degree in co-relation 1711. Up to 191 conditions per place. [2023-01-27 18:17:27,018 INFO L137 encePairwiseOnDemand]: 197/203 looper letters, 39 selfloop transitions, 5 changer transitions 27/75 dead transitions. [2023-01-27 18:17:27,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 748 flow [2023-01-27 18:17:27,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:17:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:17:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2023-01-27 18:17:27,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44475721323011963 [2023-01-27 18:17:27,021 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 632 transitions. [2023-01-27 18:17:27,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 632 transitions. [2023-01-27 18:17:27,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:17:27,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 632 transitions. [2023-01-27 18:17:27,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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:17:27,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:17:27,025 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states 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:17:27,025 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 396 flow. Second operand 7 states and 632 transitions. [2023-01-27 18:17:27,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 748 flow [2023-01-27 18:17:27,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 592 flow, removed 23 selfloop flow, removed 11 redundant places. [2023-01-27 18:17:27,031 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 287 flow [2023-01-27 18:17:27,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2023-01-27 18:17:27,031 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2023-01-27 18:17:27,031 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 287 flow [2023-01-27 18:17:27,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 0 states have call successors, (0), 0 states 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:17:27,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:17:27,032 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] [2023-01-27 18:17:27,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:17:27,032 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:17:27,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:17:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash -529076937, now seen corresponding path program 2 times [2023-01-27 18:17:27,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:17:27,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503597935] [2023-01-27 18:17:27,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:17:27,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:17:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:17:27,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:17:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:17:27,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:17:27,209 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:17:27,210 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:17:27,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:17:27,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:17:27,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:17:27,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:17:27,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:17:27,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:17:27,212 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:17:27,221 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:17:27,221 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:17:27,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:17:27 BasicIcfg [2023-01-27 18:17:27,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:17:27,294 INFO L158 Benchmark]: Toolchain (without parser) took 12736.19ms. Allocated memory was 356.5MB in the beginning and 616.6MB in the end (delta: 260.0MB). Free memory was 302.9MB in the beginning and 576.6MB in the end (delta: -273.7MB). Peak memory consumption was 113.8MB. Max. memory is 16.0GB. [2023-01-27 18:17:27,294 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 255.9MB. Free memory is still 214.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:17:27,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.49ms. Allocated memory is still 356.5MB. Free memory was 302.7MB in the beginning and 322.8MB in the end (delta: -20.1MB). Peak memory consumption was 19.3MB. Max. memory is 16.0GB. [2023-01-27 18:17:27,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.19ms. Allocated memory is still 356.5MB. Free memory was 322.8MB in the beginning and 320.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:17:27,294 INFO L158 Benchmark]: Boogie Preprocessor took 66.10ms. Allocated memory is still 356.5MB. Free memory was 320.7MB in the beginning and 318.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:17:27,295 INFO L158 Benchmark]: RCFGBuilder took 752.56ms. Allocated memory is still 356.5MB. Free memory was 318.6MB in the beginning and 285.6MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-01-27 18:17:27,295 INFO L158 Benchmark]: TraceAbstraction took 11329.02ms. Allocated memory was 356.5MB in the beginning and 616.6MB in the end (delta: 260.0MB). Free memory was 285.0MB in the beginning and 576.6MB in the end (delta: -291.6MB). Peak memory consumption was 94.5MB. Max. memory is 16.0GB. [2023-01-27 18:17:27,296 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 255.9MB. Free memory is still 214.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 489.49ms. Allocated memory is still 356.5MB. Free memory was 302.7MB in the beginning and 322.8MB in the end (delta: -20.1MB). Peak memory consumption was 19.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 88.19ms. Allocated memory is still 356.5MB. Free memory was 322.8MB in the beginning and 320.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 66.10ms. Allocated memory is still 356.5MB. Free memory was 320.7MB in the beginning and 318.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 752.56ms. Allocated memory is still 356.5MB. Free memory was 318.6MB in the beginning and 285.6MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 11329.02ms. Allocated memory was 356.5MB in the beginning and 616.6MB in the end (delta: 260.0MB). Free memory was 285.0MB in the beginning and 576.6MB in the end (delta: -291.6MB). Peak memory consumption was 94.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 112 PlacesBefore, 32 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 4444 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2167, independent: 2017, independent conditional: 0, independent unconditional: 2017, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1012, independent: 969, independent conditional: 0, independent unconditional: 969, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2167, independent: 1048, independent conditional: 0, independent unconditional: 1048, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 1012, unknown conditional: 0, unknown unconditional: 1012] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1897, ((void *)0), P0, ((void *)0))=-2, t1897={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] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1898, ((void *)0), P1, ((void *)0))=-1, t1897={5:0}, t1898={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] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1899, ((void *)0), P2, ((void *)0))=0, t1897={5:0}, t1898={6:0}, t1899={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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 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) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 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)) [L759] 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)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L809] 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) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 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 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=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=2] [L789] 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) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 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 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$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=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3: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=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 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 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 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_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3: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=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L851] 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_p2_EAX=1, __unbuffered_p2_EBX=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=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=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 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: 11.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 799 IncrementalHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 11 mSDtfsCounter, 799 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=396occurred in iteration=11, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 895 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:17:27,320 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...