/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:43:43,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:43:43,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:43:43,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:43:43,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:43:43,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:43:43,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:43:43,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:43:43,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:43:43,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:43:43,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:43:43,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:43:43,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:43:43,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:43:43,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:43:43,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:43:43,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:43:43,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:43:43,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:43:43,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:43:43,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:43:43,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:43:43,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:43:43,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:43:43,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:43:43,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:43:43,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:43:43,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:43:43,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:43:43,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:43:43,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:43:43,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:43:43,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:43:43,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:43:43,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:43:43,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:43:43,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:43:43,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:43:43,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:43:43,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:43:43,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:43:43,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 00:43:43,933 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:43:43,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:43:43,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:43:43,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:43:43,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:43:43,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:43:43,935 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:43:43,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:43:43,935 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:43:43,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:43:43,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:43:43,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:43:43,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:43:43,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:43:43,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:43:43,936 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:43:43,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:43:43,936 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:43:43,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:43:43,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:43:43,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:43:43,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:43:43,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:43:43,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:43:43,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:43:43,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:43:43,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:43:43,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:43:43,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:43:43,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:43:43,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:43:43,937 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:43:44,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:43:44,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:43:44,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:43:44,119 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:43:44,119 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:43:44,120 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-01-28 00:43:45,123 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:43:45,292 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:43:45,293 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055.opt.i [2023-01-28 00:43:45,301 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac7723305/e3c942d0d82b48c1bbff4dcf31648b74/FLAG624794913 [2023-01-28 00:43:45,315 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac7723305/e3c942d0d82b48c1bbff4dcf31648b74 [2023-01-28 00:43:45,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:43:45,318 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:43:45,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:43:45,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:43:45,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:43:45,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b725535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45, skipping insertion in model container [2023-01-28 00:43:45,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:43:45,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:43:45,442 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/mix055.opt.i[944,957] [2023-01-28 00:43:45,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:43:45,604 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:43:45,612 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/mix055.opt.i[944,957] [2023-01-28 00:43:45,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:43:45,687 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:43:45,687 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:43:45,692 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:43:45,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45 WrapperNode [2023-01-28 00:43:45,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:43:45,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:43:45,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:43:45,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:43:45,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,748 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-01-28 00:43:45,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:43:45,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:43:45,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:43:45,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:43:45,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,767 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:43:45,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:43:45,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:43:45,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:43:45,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (1/1) ... [2023-01-28 00:43:45,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:43:45,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:43:45,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 00:43:45,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 00:43:45,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:43:45,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:43:45,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:43:45,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:43:45,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:43:45,856 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:43:45,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:43:45,858 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:43:45,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:43:45,859 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:43:45,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:43:45,859 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 00:43:45,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 00:43:45,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:43:45,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:43:45,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:43:45,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:43:45,860 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:43:46,022 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:43:46,024 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:43:46,205 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:43:46,298 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:43:46,298 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:43:46,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:43:46 BoogieIcfgContainer [2023-01-28 00:43:46,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:43:46,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:43:46,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:43:46,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:43:46,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:43:45" (1/3) ... [2023-01-28 00:43:46,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1074ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:43:46, skipping insertion in model container [2023-01-28 00:43:46,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:43:45" (2/3) ... [2023-01-28 00:43:46,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1074ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:43:46, skipping insertion in model container [2023-01-28 00:43:46,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:43:46" (3/3) ... [2023-01-28 00:43:46,306 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2023-01-28 00:43:46,318 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:43:46,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 00:43:46,319 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:43:46,373 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:43:46,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 272 flow [2023-01-28 00:43:46,455 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-01-28 00:43:46,456 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:43:46,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-01-28 00:43:46,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 126 transitions, 272 flow [2023-01-28 00:43:46,468 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 256 flow [2023-01-28 00:43:46,471 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:43:46,488 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 122 transitions, 256 flow [2023-01-28 00:43:46,493 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 122 transitions, 256 flow [2023-01-28 00:43:46,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 122 transitions, 256 flow [2023-01-28 00:43:46,563 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-01-28 00:43:46,563 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:43:46,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-01-28 00:43:46,567 INFO L119 LiptonReduction]: Number of co-enabled transitions 2736 [2023-01-28 00:43:50,421 INFO L134 LiptonReduction]: Checked pairs total: 6937 [2023-01-28 00:43:50,422 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-01-28 00:43:50,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:43:50,435 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;@393149b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:43:50,435 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-28 00:43:50,440 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2023-01-28 00:43:50,440 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:43:50,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:50,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:50,441 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:50,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:50,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1113147127, now seen corresponding path program 1 times [2023-01-28 00:43:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:50,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991351700] [2023-01-28 00:43:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:50,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:50,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991351700] [2023-01-28 00:43:50,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991351700] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:50,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:50,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 00:43:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4257320] [2023-01-28 00:43:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:50,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:43:50,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:50,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:43:50,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:43:50,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-01-28 00:43:50,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:50,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:50,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-01-28 00:43:50,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:51,155 INFO L130 PetriNetUnfolder]: 2075/3094 cut-off events. [2023-01-28 00:43:51,155 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-01-28 00:43:51,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6090 conditions, 3094 events. 2075/3094 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16319 event pairs, 518 based on Foata normal form. 0/2937 useless extension candidates. Maximal degree in co-relation 6078. Up to 2098 conditions per place. [2023-01-28 00:43:51,170 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-01-28 00:43:51,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 152 flow [2023-01-28 00:43:51,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:43:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:43:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-01-28 00:43:51,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2023-01-28 00:43:51,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-01-28 00:43:51,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-01-28 00:43:51,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:51,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-01-28 00:43:51,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:51,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:51,190 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:51,191 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 3 states and 370 transitions. [2023-01-28 00:43:51,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 152 flow [2023-01-28 00:43:51,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 00:43:51,195 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-01-28 00:43:51,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-01-28 00:43:51,199 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-01-28 00:43:51,199 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-01-28 00:43:51,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:51,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:51,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:51,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:43:51,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:51,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash -287467971, now seen corresponding path program 1 times [2023-01-28 00:43:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533730323] [2023-01-28 00:43:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:52,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:52,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533730323] [2023-01-28 00:43:52,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533730323] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:52,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:52,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:43:52,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011907813] [2023-01-28 00:43:52,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:52,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:43:52,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:52,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:43:52,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:43:52,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-01-28 00:43:52,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:52,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:52,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-01-28 00:43:52,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:52,798 INFO L130 PetriNetUnfolder]: 6684/9253 cut-off events. [2023-01-28 00:43:52,799 INFO L131 PetriNetUnfolder]: For 444/444 co-relation queries the response was YES. [2023-01-28 00:43:52,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19240 conditions, 9253 events. 6684/9253 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 47083 event pairs, 506 based on Foata normal form. 250/9503 useless extension candidates. Maximal degree in co-relation 19230. Up to 6757 conditions per place. [2023-01-28 00:43:52,835 INFO L137 encePairwiseOnDemand]: 225/235 looper letters, 51 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2023-01-28 00:43:52,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 62 transitions, 274 flow [2023-01-28 00:43:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:43:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:43:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-01-28 00:43:52,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851063829787234 [2023-01-28 00:43:52,839 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-01-28 00:43:52,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-01-28 00:43:52,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:52,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-01-28 00:43:52,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:52,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:52,844 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:52,844 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 4 states and 456 transitions. [2023-01-28 00:43:52,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 62 transitions, 274 flow [2023-01-28 00:43:52,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 62 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:52,847 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 128 flow [2023-01-28 00:43:52,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2023-01-28 00:43:52,847 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-01-28 00:43:52,847 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 128 flow [2023-01-28 00:43:52,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:52,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:52,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:52,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:43:52,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:52,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:52,850 INFO L85 PathProgramCache]: Analyzing trace with hash -321574632, now seen corresponding path program 1 times [2023-01-28 00:43:52,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:52,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898709905] [2023-01-28 00:43:52,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:53,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:53,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898709905] [2023-01-28 00:43:53,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898709905] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:53,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:53,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:43:53,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46327939] [2023-01-28 00:43:53,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:53,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:43:53,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:53,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:43:53,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:43:53,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-01-28 00:43:53,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:53,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:53,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-01-28 00:43:53,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:53,857 INFO L130 PetriNetUnfolder]: 5106/7424 cut-off events. [2023-01-28 00:43:53,857 INFO L131 PetriNetUnfolder]: For 2630/2659 co-relation queries the response was YES. [2023-01-28 00:43:53,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19410 conditions, 7424 events. 5106/7424 cut-off events. For 2630/2659 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 39904 event pairs, 1437 based on Foata normal form. 39/7296 useless extension candidates. Maximal degree in co-relation 19398. Up to 5940 conditions per place. [2023-01-28 00:43:53,895 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 39 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-01-28 00:43:53,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 264 flow [2023-01-28 00:43:53,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:43:53,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:43:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-01-28 00:43:53,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078014184397163 [2023-01-28 00:43:53,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-01-28 00:43:53,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-01-28 00:43:53,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:53,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-01-28 00:43:53,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:53,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:53,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:53,899 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 128 flow. Second operand 3 states and 358 transitions. [2023-01-28 00:43:53,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 264 flow [2023-01-28 00:43:53,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:43:53,901 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 159 flow [2023-01-28 00:43:53,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-01-28 00:43:53,902 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-01-28 00:43:53,902 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 159 flow [2023-01-28 00:43:53,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:53,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:53,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:53,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:43:53,902 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:53,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:53,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1406657115, now seen corresponding path program 1 times [2023-01-28 00:43:53,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:53,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038113303] [2023-01-28 00:43:53,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:53,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038113303] [2023-01-28 00:43:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038113303] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:54,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:54,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:43:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947255566] [2023-01-28 00:43:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:54,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:43:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:43:54,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:43:54,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-01-28 00:43:54,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:54,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:54,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-01-28 00:43:54,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:55,389 INFO L130 PetriNetUnfolder]: 7138/9859 cut-off events. [2023-01-28 00:43:55,389 INFO L131 PetriNetUnfolder]: For 4361/4361 co-relation queries the response was YES. [2023-01-28 00:43:55,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28195 conditions, 9859 events. 7138/9859 cut-off events. For 4361/4361 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 46782 event pairs, 889 based on Foata normal form. 56/9915 useless extension candidates. Maximal degree in co-relation 28180. Up to 6766 conditions per place. [2023-01-28 00:43:55,436 INFO L137 encePairwiseOnDemand]: 224/235 looper letters, 52 selfloop transitions, 20 changer transitions 0/72 dead transitions. [2023-01-28 00:43:55,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 72 transitions, 428 flow [2023-01-28 00:43:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:43:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:43:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-01-28 00:43:55,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4776595744680851 [2023-01-28 00:43:55,438 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-01-28 00:43:55,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-01-28 00:43:55,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:55,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-01-28 00:43:55,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:55,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:55,441 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:55,441 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 159 flow. Second operand 4 states and 449 transitions. [2023-01-28 00:43:55,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 72 transitions, 428 flow [2023-01-28 00:43:55,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 72 transitions, 424 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:43:55,446 INFO L231 Difference]: Finished difference. Result has 46 places, 49 transitions, 314 flow [2023-01-28 00:43:55,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=46, PETRI_TRANSITIONS=49} [2023-01-28 00:43:55,447 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-01-28 00:43:55,448 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 49 transitions, 314 flow [2023-01-28 00:43:55,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:55,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:55,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:55,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:43:55,448 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:55,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:55,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1406583645, now seen corresponding path program 2 times [2023-01-28 00:43:55,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:55,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948819276] [2023-01-28 00:43:55,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:55,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:55,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948819276] [2023-01-28 00:43:55,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948819276] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:55,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:55,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:43:55,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079896861] [2023-01-28 00:43:55,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:55,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:43:55,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:43:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:43:55,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-28 00:43:55,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 49 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:55,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:55,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-28 00:43:55,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:56,384 INFO L130 PetriNetUnfolder]: 5691/8153 cut-off events. [2023-01-28 00:43:56,384 INFO L131 PetriNetUnfolder]: For 11486/12080 co-relation queries the response was YES. [2023-01-28 00:43:56,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28134 conditions, 8153 events. 5691/8153 cut-off events. For 11486/12080 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 43540 event pairs, 1087 based on Foata normal form. 200/8195 useless extension candidates. Maximal degree in co-relation 28116. Up to 5845 conditions per place. [2023-01-28 00:43:56,434 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 57 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2023-01-28 00:43:56,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 566 flow [2023-01-28 00:43:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:43:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:43:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-01-28 00:43:56,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010638297872341 [2023-01-28 00:43:56,436 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-01-28 00:43:56,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-01-28 00:43:56,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:56,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-01-28 00:43:56,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:56,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:56,439 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:56,439 INFO L175 Difference]: Start difference. First operand has 46 places, 49 transitions, 314 flow. Second operand 4 states and 471 transitions. [2023-01-28 00:43:56,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 566 flow [2023-01-28 00:43:56,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:43:56,445 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 354 flow [2023-01-28 00:43:56,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=354, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2023-01-28 00:43:56,447 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-01-28 00:43:56,447 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 354 flow [2023-01-28 00:43:56,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:56,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:56,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:56,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:43:56,447 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:56,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1740939578, now seen corresponding path program 1 times [2023-01-28 00:43:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:56,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971178383] [2023-01-28 00:43:56,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:56,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:56,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:56,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971178383] [2023-01-28 00:43:56,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971178383] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:56,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:56,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:43:56,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241042610] [2023-01-28 00:43:56,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:56,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:43:56,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:56,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:43:56,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:43:56,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-01-28 00:43:56,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 354 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:56,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:56,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-01-28 00:43:56,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:57,442 INFO L130 PetriNetUnfolder]: 5590/8028 cut-off events. [2023-01-28 00:43:57,443 INFO L131 PetriNetUnfolder]: For 13902/14605 co-relation queries the response was YES. [2023-01-28 00:43:57,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29198 conditions, 8028 events. 5590/8028 cut-off events. For 13902/14605 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 43297 event pairs, 1027 based on Foata normal form. 151/7996 useless extension candidates. Maximal degree in co-relation 29178. Up to 5331 conditions per place. [2023-01-28 00:43:57,530 INFO L137 encePairwiseOnDemand]: 230/235 looper letters, 60 selfloop transitions, 12 changer transitions 0/83 dead transitions. [2023-01-28 00:43:57,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 83 transitions, 677 flow [2023-01-28 00:43:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:43:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:43:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-01-28 00:43:57,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095744680851064 [2023-01-28 00:43:57,532 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-01-28 00:43:57,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-01-28 00:43:57,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:57,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-01-28 00:43:57,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:57,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:57,535 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:57,535 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 354 flow. Second operand 4 states and 479 transitions. [2023-01-28 00:43:57,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 83 transitions, 677 flow [2023-01-28 00:43:57,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 83 transitions, 666 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:57,543 INFO L231 Difference]: Finished difference. Result has 51 places, 57 transitions, 424 flow [2023-01-28 00:43:57,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=424, PETRI_PLACES=51, PETRI_TRANSITIONS=57} [2023-01-28 00:43:57,545 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-01-28 00:43:57,545 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 57 transitions, 424 flow [2023-01-28 00:43:57,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:57,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:57,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:57,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:43:57,546 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:57,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1942097801, now seen corresponding path program 1 times [2023-01-28 00:43:57,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:57,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922789293] [2023-01-28 00:43:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:43:58,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:58,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922789293] [2023-01-28 00:43:58,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922789293] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:58,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:58,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:43:58,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365240719] [2023-01-28 00:43:58,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:58,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:43:58,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:43:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:43:58,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-28 00:43:58,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 57 transitions, 424 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:58,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:58,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-28 00:43:58,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:58,690 INFO L130 PetriNetUnfolder]: 6349/9129 cut-off events. [2023-01-28 00:43:58,690 INFO L131 PetriNetUnfolder]: For 19700/20381 co-relation queries the response was YES. [2023-01-28 00:43:58,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34270 conditions, 9129 events. 6349/9129 cut-off events. For 19700/20381 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 49914 event pairs, 902 based on Foata normal form. 272/9227 useless extension candidates. Maximal degree in co-relation 34249. Up to 5519 conditions per place. [2023-01-28 00:43:58,748 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 70 selfloop transitions, 13 changer transitions 0/94 dead transitions. [2023-01-28 00:43:58,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 94 transitions, 780 flow [2023-01-28 00:43:58,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:43:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:43:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2023-01-28 00:43:58,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49957446808510636 [2023-01-28 00:43:58,750 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2023-01-28 00:43:58,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2023-01-28 00:43:58,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:58,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2023-01-28 00:43:58,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:58,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:58,753 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:58,753 INFO L175 Difference]: Start difference. First operand has 51 places, 57 transitions, 424 flow. Second operand 5 states and 587 transitions. [2023-01-28 00:43:58,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 94 transitions, 780 flow [2023-01-28 00:43:58,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 766 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-01-28 00:43:58,766 INFO L231 Difference]: Finished difference. Result has 56 places, 61 transitions, 499 flow [2023-01-28 00:43:58,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=499, PETRI_PLACES=56, PETRI_TRANSITIONS=61} [2023-01-28 00:43:58,767 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-01-28 00:43:58,767 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 61 transitions, 499 flow [2023-01-28 00:43:58,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:58,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:58,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:58,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:43:58,768 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:58,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1967026285, now seen corresponding path program 1 times [2023-01-28 00:43:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:58,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602452053] [2023-01-28 00:43:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:58,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:43:59,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-28 00:43:59,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:43:59,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602452053] [2023-01-28 00:43:59,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602452053] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:43:59,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:43:59,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:43:59,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965494141] [2023-01-28 00:43:59,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:43:59,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:43:59,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:43:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:43:59,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:43:59,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-01-28 00:43:59,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 499 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:59,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:43:59,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-01-28 00:43:59,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:43:59,819 INFO L130 PetriNetUnfolder]: 6579/9467 cut-off events. [2023-01-28 00:43:59,820 INFO L131 PetriNetUnfolder]: For 30685/31486 co-relation queries the response was YES. [2023-01-28 00:43:59,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37572 conditions, 9467 events. 6579/9467 cut-off events. For 30685/31486 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 52555 event pairs, 1126 based on Foata normal form. 362/9680 useless extension candidates. Maximal degree in co-relation 37548. Up to 5556 conditions per place. [2023-01-28 00:43:59,866 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 71 selfloop transitions, 23 changer transitions 0/105 dead transitions. [2023-01-28 00:43:59,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 951 flow [2023-01-28 00:43:59,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:43:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:43:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions. [2023-01-28 00:43:59,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49148936170212765 [2023-01-28 00:43:59,868 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 693 transitions. [2023-01-28 00:43:59,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 693 transitions. [2023-01-28 00:43:59,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:43:59,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 693 transitions. [2023-01-28 00:43:59,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:59,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:59,871 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:59,871 INFO L175 Difference]: Start difference. First operand has 56 places, 61 transitions, 499 flow. Second operand 6 states and 693 transitions. [2023-01-28 00:43:59,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 951 flow [2023-01-28 00:43:59,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 105 transitions, 922 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-28 00:43:59,906 INFO L231 Difference]: Finished difference. Result has 60 places, 67 transitions, 611 flow [2023-01-28 00:43:59,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=611, PETRI_PLACES=60, PETRI_TRANSITIONS=67} [2023-01-28 00:43:59,906 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-01-28 00:43:59,906 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 67 transitions, 611 flow [2023-01-28 00:43:59,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:43:59,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:43:59,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:43:59,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:43:59,907 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:43:59,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:43:59,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1117299462, now seen corresponding path program 1 times [2023-01-28 00:43:59,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:43:59,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731433094] [2023-01-28 00:43:59,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:43:59,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:43:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:44:00,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:00,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731433094] [2023-01-28 00:44:00,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731433094] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:00,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:00,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:44:00,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509033381] [2023-01-28 00:44:00,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:00,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:44:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:00,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:44:00,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:44:00,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-01-28 00:44:00,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 67 transitions, 611 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:00,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:00,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-01-28 00:44:00,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:00,747 INFO L130 PetriNetUnfolder]: 5301/7874 cut-off events. [2023-01-28 00:44:00,747 INFO L131 PetriNetUnfolder]: For 37538/39345 co-relation queries the response was YES. [2023-01-28 00:44:00,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33293 conditions, 7874 events. 5301/7874 cut-off events. For 37538/39345 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 47290 event pairs, 766 based on Foata normal form. 1420/9011 useless extension candidates. Maximal degree in co-relation 33268. Up to 3520 conditions per place. [2023-01-28 00:44:00,784 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 130 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2023-01-28 00:44:00,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 150 transitions, 1703 flow [2023-01-28 00:44:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:44:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:44:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-01-28 00:44:00,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 00:44:00,786 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-01-28 00:44:00,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-01-28 00:44:00,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:00,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-01-28 00:44:00,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:00,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:00,790 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:00,790 INFO L175 Difference]: Start difference. First operand has 60 places, 67 transitions, 611 flow. Second operand 4 states and 470 transitions. [2023-01-28 00:44:00,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 150 transitions, 1703 flow [2023-01-28 00:44:00,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 150 transitions, 1630 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-01-28 00:44:00,821 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 642 flow [2023-01-28 00:44:00,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=642, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2023-01-28 00:44:00,821 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2023-01-28 00:44:00,821 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 72 transitions, 642 flow [2023-01-28 00:44:00,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:00,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:00,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:00,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:44:00,822 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:44:00,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash -404051366, now seen corresponding path program 1 times [2023-01-28 00:44:00,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:00,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154291057] [2023-01-28 00:44:00,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:00,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:44:01,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154291057] [2023-01-28 00:44:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154291057] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:01,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:44:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435486091] [2023-01-28 00:44:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:01,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:44:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:01,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:44:01,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:44:01,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-01-28 00:44:01,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 72 transitions, 642 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:01,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:01,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-01-28 00:44:01,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:01,695 INFO L130 PetriNetUnfolder]: 4278/6562 cut-off events. [2023-01-28 00:44:01,695 INFO L131 PetriNetUnfolder]: For 31935/33906 co-relation queries the response was YES. [2023-01-28 00:44:01,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30533 conditions, 6562 events. 4278/6562 cut-off events. For 31935/33906 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 40568 event pairs, 582 based on Foata normal form. 1320/7630 useless extension candidates. Maximal degree in co-relation 30506. Up to 2725 conditions per place. [2023-01-28 00:44:01,731 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 165 selfloop transitions, 10 changer transitions 0/189 dead transitions. [2023-01-28 00:44:01,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 189 transitions, 2136 flow [2023-01-28 00:44:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:44:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:44:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-01-28 00:44:01,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2023-01-28 00:44:01,733 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-01-28 00:44:01,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-01-28 00:44:01,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:01,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-01-28 00:44:01,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:01,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:01,738 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:01,738 INFO L175 Difference]: Start difference. First operand has 62 places, 72 transitions, 642 flow. Second operand 5 states and 590 transitions. [2023-01-28 00:44:01,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 189 transitions, 2136 flow [2023-01-28 00:44:01,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 189 transitions, 2133 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:44:01,763 INFO L231 Difference]: Finished difference. Result has 67 places, 77 transitions, 719 flow [2023-01-28 00:44:01,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=719, PETRI_PLACES=67, PETRI_TRANSITIONS=77} [2023-01-28 00:44:01,764 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-01-28 00:44:01,764 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 77 transitions, 719 flow [2023-01-28 00:44:01,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:01,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:01,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:01,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:44:01,765 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:44:01,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:01,765 INFO L85 PathProgramCache]: Analyzing trace with hash 123972030, now seen corresponding path program 1 times [2023-01-28 00:44:01,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:01,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900876296] [2023-01-28 00:44:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:44:02,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:02,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900876296] [2023-01-28 00:44:02,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900876296] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:02,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:02,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:44:02,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968065056] [2023-01-28 00:44:02,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:02,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:44:02,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:02,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:44:02,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:44:02,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-01-28 00:44:02,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 77 transitions, 719 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:02,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:02,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-01-28 00:44:02,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:03,243 INFO L130 PetriNetUnfolder]: 7845/11623 cut-off events. [2023-01-28 00:44:03,243 INFO L131 PetriNetUnfolder]: For 50771/50771 co-relation queries the response was YES. [2023-01-28 00:44:03,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57534 conditions, 11623 events. 7845/11623 cut-off events. For 50771/50771 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 67127 event pairs, 1644 based on Foata normal form. 49/11672 useless extension candidates. Maximal degree in co-relation 57504. Up to 5838 conditions per place. [2023-01-28 00:44:03,295 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 105 selfloop transitions, 14 changer transitions 18/137 dead transitions. [2023-01-28 00:44:03,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 137 transitions, 1462 flow [2023-01-28 00:44:03,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:44:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:44:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2023-01-28 00:44:03,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2023-01-28 00:44:03,300 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 450 transitions. [2023-01-28 00:44:03,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions. [2023-01-28 00:44:03,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:03,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions. [2023-01-28 00:44:03,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:03,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:03,303 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:03,303 INFO L175 Difference]: Start difference. First operand has 67 places, 77 transitions, 719 flow. Second operand 4 states and 450 transitions. [2023-01-28 00:44:03,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 137 transitions, 1462 flow [2023-01-28 00:44:03,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 137 transitions, 1434 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-28 00:44:03,361 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 783 flow [2023-01-28 00:44:03,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=783, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2023-01-28 00:44:03,361 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-01-28 00:44:03,361 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 78 transitions, 783 flow [2023-01-28 00:44:03,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:03,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:03,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:03,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:44:03,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:44:03,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:03,362 INFO L85 PathProgramCache]: Analyzing trace with hash 545105262, now seen corresponding path program 1 times [2023-01-28 00:44:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022555092] [2023-01-28 00:44:03,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:44:03,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:03,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022555092] [2023-01-28 00:44:03,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022555092] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:03,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:03,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:44:03,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273153413] [2023-01-28 00:44:03,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:03,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:44:03,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:03,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:44:03,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:44:03,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-01-28 00:44:03,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 78 transitions, 783 flow. Second operand has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:03,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:03,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-01-28 00:44:03,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:03,936 INFO L130 PetriNetUnfolder]: 2081/3376 cut-off events. [2023-01-28 00:44:03,936 INFO L131 PetriNetUnfolder]: For 18823/19586 co-relation queries the response was YES. [2023-01-28 00:44:03,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16968 conditions, 3376 events. 2081/3376 cut-off events. For 18823/19586 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 19985 event pairs, 226 based on Foata normal form. 647/3906 useless extension candidates. Maximal degree in co-relation 16936. Up to 1315 conditions per place. [2023-01-28 00:44:03,957 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 148 selfloop transitions, 14 changer transitions 16/191 dead transitions. [2023-01-28 00:44:03,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 191 transitions, 2257 flow [2023-01-28 00:44:03,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:44:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:44:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 706 transitions. [2023-01-28 00:44:03,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500709219858156 [2023-01-28 00:44:03,960 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 706 transitions. [2023-01-28 00:44:03,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 706 transitions. [2023-01-28 00:44:03,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:03,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 706 transitions. [2023-01-28 00:44:03,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:03,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:03,963 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:03,963 INFO L175 Difference]: Start difference. First operand has 70 places, 78 transitions, 783 flow. Second operand 6 states and 706 transitions. [2023-01-28 00:44:03,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 191 transitions, 2257 flow [2023-01-28 00:44:04,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 191 transitions, 2211 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-01-28 00:44:04,002 INFO L231 Difference]: Finished difference. Result has 73 places, 82 transitions, 812 flow [2023-01-28 00:44:04,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=812, PETRI_PLACES=73, PETRI_TRANSITIONS=82} [2023-01-28 00:44:04,003 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2023-01-28 00:44:04,004 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 82 transitions, 812 flow [2023-01-28 00:44:04,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:04,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:04,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:04,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:44:04,004 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:44:04,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash 729285713, now seen corresponding path program 1 times [2023-01-28 00:44:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:04,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998047143] [2023-01-28 00:44:04,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:44:04,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:04,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998047143] [2023-01-28 00:44:04,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998047143] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:04,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:04,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:44:04,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925760083] [2023-01-28 00:44:04,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:04,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:44:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:04,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:44:04,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:44:04,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-01-28 00:44:04,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 82 transitions, 812 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:04,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:04,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-01-28 00:44:04,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:04,607 INFO L130 PetriNetUnfolder]: 3218/5242 cut-off events. [2023-01-28 00:44:04,607 INFO L131 PetriNetUnfolder]: For 27229/27843 co-relation queries the response was YES. [2023-01-28 00:44:04,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27528 conditions, 5242 events. 3218/5242 cut-off events. For 27229/27843 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 33292 event pairs, 414 based on Foata normal form. 356/5497 useless extension candidates. Maximal degree in co-relation 27495. Up to 2675 conditions per place. [2023-01-28 00:44:04,628 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 108 selfloop transitions, 2 changer transitions 46/166 dead transitions. [2023-01-28 00:44:04,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 166 transitions, 1923 flow [2023-01-28 00:44:04,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:44:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:44:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-01-28 00:44:04,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180851063829788 [2023-01-28 00:44:04,630 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-01-28 00:44:04,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-01-28 00:44:04,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:04,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-01-28 00:44:04,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:04,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:04,632 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:04,632 INFO L175 Difference]: Start difference. First operand has 73 places, 82 transitions, 812 flow. Second operand 4 states and 487 transitions. [2023-01-28 00:44:04,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 166 transitions, 1923 flow [2023-01-28 00:44:04,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 166 transitions, 1841 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-01-28 00:44:04,679 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 764 flow [2023-01-28 00:44:04,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=764, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2023-01-28 00:44:04,680 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2023-01-28 00:44:04,680 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 764 flow [2023-01-28 00:44:04,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:04,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:04,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:04,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:44:04,680 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:44:04,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:04,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1662989261, now seen corresponding path program 2 times [2023-01-28 00:44:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:04,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017594013] [2023-01-28 00:44:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:04,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:04,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-28 00:44:04,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017594013] [2023-01-28 00:44:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017594013] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:04,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:44:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033839747] [2023-01-28 00:44:04,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:04,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:44:04,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:04,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:44:04,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:44:04,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-01-28 00:44:04,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 764 flow. Second operand has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:04,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:04,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-01-28 00:44:04,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:05,291 INFO L130 PetriNetUnfolder]: 2653/4373 cut-off events. [2023-01-28 00:44:05,291 INFO L131 PetriNetUnfolder]: For 21286/22224 co-relation queries the response was YES. [2023-01-28 00:44:05,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21729 conditions, 4373 events. 2653/4373 cut-off events. For 21286/22224 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 28435 event pairs, 222 based on Foata normal form. 671/4894 useless extension candidates. Maximal degree in co-relation 21695. Up to 1571 conditions per place. [2023-01-28 00:44:05,310 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 82 selfloop transitions, 18 changer transitions 60/167 dead transitions. [2023-01-28 00:44:05,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 167 transitions, 1945 flow [2023-01-28 00:44:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:44:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:44:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 802 transitions. [2023-01-28 00:44:05,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48753799392097263 [2023-01-28 00:44:05,312 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 802 transitions. [2023-01-28 00:44:05,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 802 transitions. [2023-01-28 00:44:05,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:05,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 802 transitions. [2023-01-28 00:44:05,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:05,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:05,316 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:05,316 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 764 flow. Second operand 7 states and 802 transitions. [2023-01-28 00:44:05,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 167 transitions, 1945 flow [2023-01-28 00:44:05,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 167 transitions, 1910 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-28 00:44:05,379 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 572 flow [2023-01-28 00:44:05,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=572, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2023-01-28 00:44:05,380 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2023-01-28 00:44:05,380 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 572 flow [2023-01-28 00:44:05,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:05,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:05,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:05,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:44:05,381 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:44:05,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:05,381 INFO L85 PathProgramCache]: Analyzing trace with hash -655104347, now seen corresponding path program 1 times [2023-01-28 00:44:05,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:05,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643788387] [2023-01-28 00:44:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:44:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:44:05,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:44:05,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643788387] [2023-01-28 00:44:05,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643788387] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:44:05,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:44:05,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:44:05,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052965161] [2023-01-28 00:44:05,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:44:05,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:44:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:44:05,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:44:05,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:44:05,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-01-28 00:44:05,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 572 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:05,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:44:05,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-01-28 00:44:05,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:44:06,065 INFO L130 PetriNetUnfolder]: 844/1425 cut-off events. [2023-01-28 00:44:06,065 INFO L131 PetriNetUnfolder]: For 6683/6683 co-relation queries the response was YES. [2023-01-28 00:44:06,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7504 conditions, 1425 events. 844/1425 cut-off events. For 6683/6683 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6727 event pairs, 106 based on Foata normal form. 1/1426 useless extension candidates. Maximal degree in co-relation 7477. Up to 715 conditions per place. [2023-01-28 00:44:06,071 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 51 selfloop transitions, 6 changer transitions 82/139 dead transitions. [2023-01-28 00:44:06,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 139 transitions, 1489 flow [2023-01-28 00:44:06,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:44:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:44:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 646 transitions. [2023-01-28 00:44:06,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581560283687943 [2023-01-28 00:44:06,073 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 646 transitions. [2023-01-28 00:44:06,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 646 transitions. [2023-01-28 00:44:06,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:44:06,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 646 transitions. [2023-01-28 00:44:06,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:06,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:06,076 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:06,077 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 572 flow. Second operand 6 states and 646 transitions. [2023-01-28 00:44:06,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 139 transitions, 1489 flow [2023-01-28 00:44:06,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 139 transitions, 1293 flow, removed 32 selfloop flow, removed 13 redundant places. [2023-01-28 00:44:06,090 INFO L231 Difference]: Finished difference. Result has 74 places, 43 transitions, 308 flow [2023-01-28 00:44:06,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=74, PETRI_TRANSITIONS=43} [2023-01-28 00:44:06,091 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2023-01-28 00:44:06,091 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 43 transitions, 308 flow [2023-01-28 00:44:06,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:44:06,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:44:06,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:06,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-28 00:44:06,092 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-28 00:44:06,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:44:06,092 INFO L85 PathProgramCache]: Analyzing trace with hash 824964301, now seen corresponding path program 2 times [2023-01-28 00:44:06,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:44:06,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604268207] [2023-01-28 00:44:06,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:44:06,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:44:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:44:06,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:44:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:44:06,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:44:06,160 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:44:06,161 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-28 00:44:06,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-28 00:44:06,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-28 00:44:06,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-28 00:44:06,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-28 00:44:06,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-28 00:44:06,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-28 00:44:06,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-28 00:44:06,163 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:44:06,166 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:44:06,166 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:44:06,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:44:06 BasicIcfg [2023-01-28 00:44:06,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:44:06,234 INFO L158 Benchmark]: Toolchain (without parser) took 20916.04ms. Allocated memory was 446.7MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 400.2MB in the beginning and 1.7GB in the end (delta: -1.3GB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-28 00:44:06,234 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 308.3MB. Free memory is still 255.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:44:06,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.03ms. Allocated memory is still 446.7MB. Free memory was 399.9MB in the beginning and 376.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 00:44:06,234 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.97ms. Allocated memory is still 446.7MB. Free memory was 376.8MB in the beginning and 373.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 00:44:06,235 INFO L158 Benchmark]: Boogie Preprocessor took 21.42ms. Allocated memory is still 446.7MB. Free memory was 373.7MB in the beginning and 372.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:44:06,235 INFO L158 Benchmark]: RCFGBuilder took 529.75ms. Allocated memory is still 446.7MB. Free memory was 372.1MB in the beginning and 334.9MB in the end (delta: 37.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-01-28 00:44:06,235 INFO L158 Benchmark]: TraceAbstraction took 19931.87ms. Allocated memory was 446.7MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 334.4MB in the beginning and 1.7GB in the end (delta: -1.3GB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:44:06,236 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.09ms. Allocated memory is still 308.3MB. Free memory is still 255.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 374.03ms. Allocated memory is still 446.7MB. Free memory was 399.9MB in the beginning and 376.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.97ms. Allocated memory is still 446.7MB. Free memory was 376.8MB in the beginning and 373.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.42ms. Allocated memory is still 446.7MB. Free memory was 373.7MB in the beginning and 372.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 529.75ms. Allocated memory is still 446.7MB. Free memory was 372.1MB in the beginning and 334.9MB in the end (delta: 37.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 19931.87ms. Allocated memory was 446.7MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 334.4MB in the beginning and 1.7GB in the end (delta: -1.3GB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 133 PlacesBefore, 40 PlacesAfterwards, 122 TransitionsBefore, 27 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 109 TotalNumberOfCompositions, 6937 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3620, independent: 3421, independent conditional: 0, independent unconditional: 3421, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1487, independent: 1442, independent conditional: 0, independent unconditional: 1442, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3620, independent: 1979, independent conditional: 0, independent unconditional: 1979, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 1487, unknown conditional: 0, unknown unconditional: 1487] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-4, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=-3, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=-2, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=-1, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 843]: 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: 839]: 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: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 160 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 566 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1123 IncrementalHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 27 mSDtfsCounter, 1123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=812occurred in iteration=12, InterpolantAutomatonStates: 69, 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.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 1916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:44:06,253 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...