/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:14:33,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:14:33,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:14:33,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:14:33,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:14:33,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:14:33,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:14:33,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:14:33,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:14:33,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:14:33,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:14:33,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:14:33,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:14:33,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:14:33,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:14:33,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:14:33,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:14:33,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:14:33,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:14:33,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:14:33,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:14:33,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:14:33,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:14:33,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:14:33,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:14:33,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:14:33,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:14:33,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:14:33,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:14:33,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:14:33,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:14:33,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:14:33,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:14:33,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:14:33,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:14:33,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:14:33,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:14:33,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:14:33,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:14:33,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:14:33,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:14:33,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 18:14:33,865 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:14:33,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:14:33,867 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:14:33,867 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:14:33,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:14:33,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:14:33,868 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:14:33,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:14:33,868 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:14:33,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:14:33,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:14:33,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:14:33,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:14:33,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:14:33,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:14:33,869 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:14:33,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:14:33,870 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:14:33,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:14:33,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:14:33,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:14:33,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:14:33,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:14:33,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:14:33,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:14:33,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:14:33,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:14:33,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:14:33,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:14:33,871 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:14:33,871 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:14:33,871 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 18:14:34,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:14:34,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:14:34,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:14:34,069 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:14:34,070 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:14:34,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-01-27 18:14:35,169 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:14:35,494 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:14:35,495 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2023-01-27 18:14:35,509 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b9a3ae6/80e12c44656f4276a0e209ffc8c524ec/FLAG9ed56fad4 [2023-01-27 18:14:35,779 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b9a3ae6/80e12c44656f4276a0e209ffc8c524ec [2023-01-27 18:14:35,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:14:35,782 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:14:35,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:14:35,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:14:35,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:14:35,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:14:35" (1/1) ... [2023-01-27 18:14:35,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a82a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:35, skipping insertion in model container [2023-01-27 18:14:35,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:14:35" (1/1) ... [2023-01-27 18:14:35,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:14:35,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:14:36,024 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_tso.oepc.i[949,962] [2023-01-27 18:14:36,242 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:14:36,254 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:14:36,263 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_tso.oepc.i[949,962] [2023-01-27 18:14:36,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:14:36,369 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:14:36,369 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:14:36,377 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:14:36,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36 WrapperNode [2023-01-27 18:14:36,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:14:36,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:14:36,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:14:36,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:14:36,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (1/1) ... [2023-01-27 18:14:36,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (1/1) ... [2023-01-27 18:14:36,460 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-01-27 18:14:36,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:14:36,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:14:36,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:14:36,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:14:36,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (1/1) ... [2023-01-27 18:14:36,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (1/1) ... [2023-01-27 18:14:36,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (1/1) ... [2023-01-27 18:14:36,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (1/1) ... [2023-01-27 18:14:36,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (1/1) ... [2023-01-27 18:14:36,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (1/1) ... [2023-01-27 18:14:36,495 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (1/1) ... [2023-01-27 18:14:36,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (1/1) ... [2023-01-27 18:14:36,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:14:36,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:14:36,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:14:36,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:14:36,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (1/1) ... [2023-01-27 18:14:36,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:14:36,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:14:36,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 18:14:36,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 18:14:36,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:14:36,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:14:36,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:14:36,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:14:36,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:14:36,586 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:14:36,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:14:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:14:36,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:14:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:14:36,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:14:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-27 18:14:36,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-27 18:14:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:14:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:14:36,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:14:36,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:14:36,593 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:14:36,709 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:14:36,711 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:14:37,102 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:14:37,264 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:14:37,269 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:14:37,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:14:37 BoogieIcfgContainer [2023-01-27 18:14:37,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:14:37,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:14:37,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:14:37,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:14:37,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:14:35" (1/3) ... [2023-01-27 18:14:37,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104ea886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:14:37, skipping insertion in model container [2023-01-27 18:14:37,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:14:36" (2/3) ... [2023-01-27 18:14:37,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104ea886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:14:37, skipping insertion in model container [2023-01-27 18:14:37,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:14:37" (3/3) ... [2023-01-27 18:14:37,280 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2023-01-27 18:14:37,296 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:14:37,296 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:14:37,296 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:14:37,360 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:14:37,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2023-01-27 18:14:37,470 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-27 18:14:37,471 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:37,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-27 18:14:37,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2023-01-27 18:14:37,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2023-01-27 18:14:37,488 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:14:37,505 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2023-01-27 18:14:37,509 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2023-01-27 18:14:37,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2023-01-27 18:14:37,543 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-27 18:14:37,544 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:37,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-27 18:14:37,548 INFO L119 LiptonReduction]: Number of co-enabled transitions 3044 [2023-01-27 18:14:41,389 INFO L134 LiptonReduction]: Checked pairs total: 8921 [2023-01-27 18:14:41,390 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-01-27 18:14:41,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:14:41,409 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;@1d1d469b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:14:41,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 18:14:41,412 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-27 18:14:41,413 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:14:41,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:41,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-27 18:14:41,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:41,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash 517905549, now seen corresponding path program 1 times [2023-01-27 18:14:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:41,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494749366] [2023-01-27 18:14:41,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:41,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:41,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:41,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494749366] [2023-01-27 18:14:41,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494749366] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:41,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:41,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:14:41,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050976226] [2023-01-27 18:14:41,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:41,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:14:41,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:41,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:14:41,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:14:41,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 233 [2023-01-27 18:14:41,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:41,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:41,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 233 [2023-01-27 18:14:41,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:42,845 INFO L130 PetriNetUnfolder]: 5463/7958 cut-off events. [2023-01-27 18:14:42,845 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-01-27 18:14:42,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15558 conditions, 7958 events. 5463/7958 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 47267 event pairs, 1005 based on Foata normal form. 256/7685 useless extension candidates. Maximal degree in co-relation 15546. Up to 5923 conditions per place. [2023-01-27 18:14:42,901 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 39 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2023-01-27 18:14:42,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 206 flow [2023-01-27 18:14:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:14:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:14:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-01-27 18:14:42,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5493562231759657 [2023-01-27 18:14:42,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-01-27 18:14:42,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-01-27 18:14:42,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:42,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-01-27 18:14:42,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:42,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:42,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:42,937 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 384 transitions. [2023-01-27 18:14:42,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 206 flow [2023-01-27 18:14:42,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 18:14:42,944 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-01-27 18:14:42,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-01-27 18:14:42,951 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-01-27 18:14:42,951 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-01-27 18:14:42,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:42,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:42,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:42,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:14:42,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:42,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:42,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1725633849, now seen corresponding path program 1 times [2023-01-27 18:14:42,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:42,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097072562] [2023-01-27 18:14:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:43,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:43,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097072562] [2023-01-27 18:14:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097072562] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:43,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:43,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:14:43,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478774930] [2023-01-27 18:14:43,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:43,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:14:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:43,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:14:43,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:14:43,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-01-27 18:14:43,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 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-27 18:14:43,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:43,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-01-27 18:14:43,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:44,255 INFO L130 PetriNetUnfolder]: 5447/7784 cut-off events. [2023-01-27 18:14:44,256 INFO L131 PetriNetUnfolder]: For 509/509 co-relation queries the response was YES. [2023-01-27 18:14:44,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16006 conditions, 7784 events. 5447/7784 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 42032 event pairs, 1399 based on Foata normal form. 320/8100 useless extension candidates. Maximal degree in co-relation 15996. Up to 5953 conditions per place. [2023-01-27 18:14:44,297 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 35 selfloop transitions, 3 changer transitions 23/64 dead transitions. [2023-01-27 18:14:44,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 270 flow [2023-01-27 18:14:44,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:14:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:14:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-01-27 18:14:44,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175965665236052 [2023-01-27 18:14:44,300 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-01-27 18:14:44,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-01-27 18:14:44,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:44,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-01-27 18:14:44,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:44,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:44,306 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:44,306 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 603 transitions. [2023-01-27 18:14:44,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 270 flow [2023-01-27 18:14:44,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:14:44,319 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 91 flow [2023-01-27 18:14:44,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-01-27 18:14:44,320 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2023-01-27 18:14:44,320 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 91 flow [2023-01-27 18:14:44,321 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-27 18:14:44,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:44,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:44,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:14:44,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:44,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1955012510, now seen corresponding path program 1 times [2023-01-27 18:14:44,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:44,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248145011] [2023-01-27 18:14:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:44,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:44,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248145011] [2023-01-27 18:14:44,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248145011] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:44,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:44,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:14:44,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7361985] [2023-01-27 18:14:44,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:44,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:14:44,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:44,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:14:44,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:14:44,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-01-27 18:14:44,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:44,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:44,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-01-27 18:14:44,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:46,489 INFO L130 PetriNetUnfolder]: 10945/14853 cut-off events. [2023-01-27 18:14:46,489 INFO L131 PetriNetUnfolder]: For 5519/5519 co-relation queries the response was YES. [2023-01-27 18:14:46,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34377 conditions, 14853 events. 10945/14853 cut-off events. For 5519/5519 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 72505 event pairs, 4148 based on Foata normal form. 579/15432 useless extension candidates. Maximal degree in co-relation 34364. Up to 12744 conditions per place. [2023-01-27 18:14:46,576 INFO L137 encePairwiseOnDemand]: 222/233 looper letters, 54 selfloop transitions, 13 changer transitions 35/102 dead transitions. [2023-01-27 18:14:46,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 102 transitions, 507 flow [2023-01-27 18:14:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2023-01-27 18:14:46,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48129981606376454 [2023-01-27 18:14:46,580 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2023-01-27 18:14:46,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2023-01-27 18:14:46,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:46,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2023-01-27 18:14:46,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:46,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:46,585 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:46,586 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 91 flow. Second operand 7 states and 785 transitions. [2023-01-27 18:14:46,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 102 transitions, 507 flow [2023-01-27 18:14:46,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 102 transitions, 498 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 18:14:46,603 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 192 flow [2023-01-27 18:14:46,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-01-27 18:14:46,604 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-01-27 18:14:46,607 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 192 flow [2023-01-27 18:14:46,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:46,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:46,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:46,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:14:46,608 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:46,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1141854111, now seen corresponding path program 1 times [2023-01-27 18:14:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:46,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753788854] [2023-01-27 18:14:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:46,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:47,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:47,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753788854] [2023-01-27 18:14:47,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753788854] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:47,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:47,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:14:47,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211630187] [2023-01-27 18:14:47,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:47,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:14:47,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:47,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:14:47,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:14:47,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-01-27 18:14:47,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:47,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:47,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-01-27 18:14:47,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:48,735 INFO L130 PetriNetUnfolder]: 7522/10631 cut-off events. [2023-01-27 18:14:48,735 INFO L131 PetriNetUnfolder]: For 18076/18292 co-relation queries the response was YES. [2023-01-27 18:14:48,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31552 conditions, 10631 events. 7522/10631 cut-off events. For 18076/18292 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 57808 event pairs, 2973 based on Foata normal form. 488/10884 useless extension candidates. Maximal degree in co-relation 31534. Up to 8015 conditions per place. [2023-01-27 18:14:48,808 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 62 selfloop transitions, 9 changer transitions 33/109 dead transitions. [2023-01-27 18:14:48,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 109 transitions, 658 flow [2023-01-27 18:14:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2023-01-27 18:14:48,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033721643163703 [2023-01-27 18:14:48,812 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2023-01-27 18:14:48,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2023-01-27 18:14:48,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:48,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2023-01-27 18:14:48,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:48,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:48,826 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:48,826 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 192 flow. Second operand 7 states and 821 transitions. [2023-01-27 18:14:48,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 109 transitions, 658 flow [2023-01-27 18:14:48,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 109 transitions, 656 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 18:14:48,865 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 273 flow [2023-01-27 18:14:48,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-01-27 18:14:48,867 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2023-01-27 18:14:48,868 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 273 flow [2023-01-27 18:14:48,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:48,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:48,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:48,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:14:48,868 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:48,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:48,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1945803378, now seen corresponding path program 1 times [2023-01-27 18:14:48,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:48,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112113499] [2023-01-27 18:14:48,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:48,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:49,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:49,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112113499] [2023-01-27 18:14:49,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112113499] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:49,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:49,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:14:49,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599474762] [2023-01-27 18:14:49,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:49,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:14:49,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:49,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:14:49,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:14:49,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 233 [2023-01-27 18:14:49,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:49,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:49,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 233 [2023-01-27 18:14:49,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:50,691 INFO L130 PetriNetUnfolder]: 7219/10336 cut-off events. [2023-01-27 18:14:50,691 INFO L131 PetriNetUnfolder]: For 33018/33303 co-relation queries the response was YES. [2023-01-27 18:14:50,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37833 conditions, 10336 events. 7219/10336 cut-off events. For 33018/33303 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 57099 event pairs, 2192 based on Foata normal form. 419/10570 useless extension candidates. Maximal degree in co-relation 37809. Up to 7377 conditions per place. [2023-01-27 18:14:50,765 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 64 selfloop transitions, 14 changer transitions 28/111 dead transitions. [2023-01-27 18:14:50,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 807 flow [2023-01-27 18:14:50,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:14:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:14:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 832 transitions. [2023-01-27 18:14:50,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510116492949111 [2023-01-27 18:14:50,768 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 832 transitions. [2023-01-27 18:14:50,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 832 transitions. [2023-01-27 18:14:50,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:50,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 832 transitions. [2023-01-27 18:14:50,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:50,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:50,773 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:50,773 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 273 flow. Second operand 7 states and 832 transitions. [2023-01-27 18:14:50,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 807 flow [2023-01-27 18:14:50,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 111 transitions, 793 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-01-27 18:14:50,993 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 349 flow [2023-01-27 18:14:50,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-01-27 18:14:50,997 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places. [2023-01-27 18:14:50,997 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 349 flow [2023-01-27 18:14:50,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:50,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:50,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:50,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:14:50,998 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:50,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2001577274, now seen corresponding path program 1 times [2023-01-27 18:14:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:50,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921319878] [2023-01-27 18:14:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:51,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:51,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921319878] [2023-01-27 18:14:51,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921319878] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:51,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:51,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:14:51,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394782894] [2023-01-27 18:14:51,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:51,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:14:51,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:51,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:14:51,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:14:51,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-01-27 18:14:51,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 349 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:51,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:51,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-01-27 18:14:51,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:52,918 INFO L130 PetriNetUnfolder]: 6856/9760 cut-off events. [2023-01-27 18:14:52,918 INFO L131 PetriNetUnfolder]: For 50433/50705 co-relation queries the response was YES. [2023-01-27 18:14:52,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40401 conditions, 9760 events. 6856/9760 cut-off events. For 50433/50705 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 52807 event pairs, 1886 based on Foata normal form. 379/9930 useless extension candidates. Maximal degree in co-relation 40372. Up to 7209 conditions per place. [2023-01-27 18:14:53,091 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 70 selfloop transitions, 8 changer transitions 20/103 dead transitions. [2023-01-27 18:14:53,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 829 flow [2023-01-27 18:14:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:14:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:14:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2023-01-27 18:14:53,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064377682403434 [2023-01-27 18:14:53,095 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 708 transitions. [2023-01-27 18:14:53,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 708 transitions. [2023-01-27 18:14:53,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:53,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 708 transitions. [2023-01-27 18:14:53,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:53,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:53,100 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:53,100 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 349 flow. Second operand 6 states and 708 transitions. [2023-01-27 18:14:53,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 829 flow [2023-01-27 18:14:53,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 802 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-01-27 18:14:53,206 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 352 flow [2023-01-27 18:14:53,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2023-01-27 18:14:53,208 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2023-01-27 18:14:53,208 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 352 flow [2023-01-27 18:14:53,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:53,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:53,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:53,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:14:53,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:53,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:53,210 INFO L85 PathProgramCache]: Analyzing trace with hash 149202517, now seen corresponding path program 1 times [2023-01-27 18:14:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536454721] [2023-01-27 18:14:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:53,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536454721] [2023-01-27 18:14:53,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536454721] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:53,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:53,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:14:53,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699879868] [2023-01-27 18:14:53,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:53,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:14:53,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:53,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:14:53,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:14:53,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-01-27 18:14:53,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 352 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:53,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:53,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-01-27 18:14:53,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:54,893 INFO L130 PetriNetUnfolder]: 6964/9948 cut-off events. [2023-01-27 18:14:54,893 INFO L131 PetriNetUnfolder]: For 51455/51765 co-relation queries the response was YES. [2023-01-27 18:14:54,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41265 conditions, 9948 events. 6964/9948 cut-off events. For 51455/51765 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 54472 event pairs, 2109 based on Foata normal form. 346/10107 useless extension candidates. Maximal degree in co-relation 41234. Up to 7317 conditions per place. [2023-01-27 18:14:54,954 INFO L137 encePairwiseOnDemand]: 223/233 looper letters, 72 selfloop transitions, 22 changer transitions 11/110 dead transitions. [2023-01-27 18:14:54,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 868 flow [2023-01-27 18:14:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:14:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:14:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 713 transitions. [2023-01-27 18:14:54,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5100143061516452 [2023-01-27 18:14:54,957 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 713 transitions. [2023-01-27 18:14:54,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 713 transitions. [2023-01-27 18:14:54,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:54,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 713 transitions. [2023-01-27 18:14:54,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:54,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:54,961 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:54,962 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 352 flow. Second operand 6 states and 713 transitions. [2023-01-27 18:14:54,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 868 flow [2023-01-27 18:14:55,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 110 transitions, 848 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-01-27 18:14:55,107 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 497 flow [2023-01-27 18:14:55,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=497, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2023-01-27 18:14:55,107 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2023-01-27 18:14:55,108 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 497 flow [2023-01-27 18:14:55,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:55,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:55,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:55,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:14:55,109 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:55,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:55,110 INFO L85 PathProgramCache]: Analyzing trace with hash 192966457, now seen corresponding path program 2 times [2023-01-27 18:14:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:55,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874019932] [2023-01-27 18:14:55,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:55,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:55,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874019932] [2023-01-27 18:14:55,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874019932] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:55,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:55,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:14:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308047632] [2023-01-27 18:14:55,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:55,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:14:55,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:55,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:14:55,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:14:55,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 233 [2023-01-27 18:14:55,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:55,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:55,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 233 [2023-01-27 18:14:55,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:14:57,642 INFO L130 PetriNetUnfolder]: 13093/17719 cut-off events. [2023-01-27 18:14:57,642 INFO L131 PetriNetUnfolder]: For 90498/90498 co-relation queries the response was YES. [2023-01-27 18:14:57,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78619 conditions, 17719 events. 13093/17719 cut-off events. For 90498/90498 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 88088 event pairs, 2721 based on Foata normal form. 473/18192 useless extension candidates. Maximal degree in co-relation 78588. Up to 12262 conditions per place. [2023-01-27 18:14:57,741 INFO L137 encePairwiseOnDemand]: 219/233 looper letters, 115 selfloop transitions, 72 changer transitions 31/218 dead transitions. [2023-01-27 18:14:57,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 218 transitions, 1866 flow [2023-01-27 18:14:57,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 18:14:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 18:14:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1129 transitions. [2023-01-27 18:14:57,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48454935622317596 [2023-01-27 18:14:57,746 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1129 transitions. [2023-01-27 18:14:57,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1129 transitions. [2023-01-27 18:14:57,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:14:57,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1129 transitions. [2023-01-27 18:14:57,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 112.9) internal successors, (1129), 10 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:57,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:57,753 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:57,753 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 497 flow. Second operand 10 states and 1129 transitions. [2023-01-27 18:14:57,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 218 transitions, 1866 flow [2023-01-27 18:14:57,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 218 transitions, 1820 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-01-27 18:14:57,922 INFO L231 Difference]: Finished difference. Result has 81 places, 113 transitions, 1264 flow [2023-01-27 18:14:57,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1264, PETRI_PLACES=81, PETRI_TRANSITIONS=113} [2023-01-27 18:14:57,923 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-01-27 18:14:57,923 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 113 transitions, 1264 flow [2023-01-27 18:14:57,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:57,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:14:57,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:14:57,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:14:57,924 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:14:57,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:14:57,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1656708683, now seen corresponding path program 3 times [2023-01-27 18:14:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:14:57,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161296891] [2023-01-27 18:14:57,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:14:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:14:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:14:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:14:58,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:14:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161296891] [2023-01-27 18:14:58,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161296891] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:14:58,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:14:58,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:14:58,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805083534] [2023-01-27 18:14:58,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:14:58,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:14:58,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:14:58,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:14:58,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:14:58,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-01-27 18:14:58,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 113 transitions, 1264 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:14:58,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:14:58,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-01-27 18:14:58,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:00,840 INFO L130 PetriNetUnfolder]: 12271/17059 cut-off events. [2023-01-27 18:15:00,840 INFO L131 PetriNetUnfolder]: For 176279/177563 co-relation queries the response was YES. [2023-01-27 18:15:00,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100309 conditions, 17059 events. 12271/17059 cut-off events. For 176279/177563 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 93173 event pairs, 2646 based on Foata normal form. 759/17267 useless extension candidates. Maximal degree in co-relation 100270. Up to 10117 conditions per place. [2023-01-27 18:15:00,982 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 118 selfloop transitions, 35 changer transitions 28/198 dead transitions. [2023-01-27 18:15:00,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 198 transitions, 2454 flow [2023-01-27 18:15:00,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:15:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:15:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 830 transitions. [2023-01-27 18:15:00,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5088902513795218 [2023-01-27 18:15:00,985 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 830 transitions. [2023-01-27 18:15:00,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 830 transitions. [2023-01-27 18:15:00,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:00,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 830 transitions. [2023-01-27 18:15:00,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.57142857142857) internal successors, (830), 7 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:00,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:00,991 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:00,991 INFO L175 Difference]: Start difference. First operand has 81 places, 113 transitions, 1264 flow. Second operand 7 states and 830 transitions. [2023-01-27 18:15:00,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 198 transitions, 2454 flow [2023-01-27 18:15:01,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 198 transitions, 2212 flow, removed 90 selfloop flow, removed 4 redundant places. [2023-01-27 18:15:01,359 INFO L231 Difference]: Finished difference. Result has 84 places, 121 transitions, 1362 flow [2023-01-27 18:15:01,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1362, PETRI_PLACES=84, PETRI_TRANSITIONS=121} [2023-01-27 18:15:01,359 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2023-01-27 18:15:01,359 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 121 transitions, 1362 flow [2023-01-27 18:15:01,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:01,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:01,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:01,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:15:01,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:15:01,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash 374177350, now seen corresponding path program 1 times [2023-01-27 18:15:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390052434] [2023-01-27 18:15:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:01,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:01,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390052434] [2023-01-27 18:15:01,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390052434] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:01,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:01,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:15:01,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901754554] [2023-01-27 18:15:01,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:01,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:15:01,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:01,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:15:01,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:15:01,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-01-27 18:15:01,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 121 transitions, 1362 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:01,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:01,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-01-27 18:15:01,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:02,940 INFO L130 PetriNetUnfolder]: 6953/9895 cut-off events. [2023-01-27 18:15:02,941 INFO L131 PetriNetUnfolder]: For 145628/147969 co-relation queries the response was YES. [2023-01-27 18:15:02,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64511 conditions, 9895 events. 6953/9895 cut-off events. For 145628/147969 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 53641 event pairs, 1293 based on Foata normal form. 579/10023 useless extension candidates. Maximal degree in co-relation 64469. Up to 7461 conditions per place. [2023-01-27 18:15:03,011 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 143 selfloop transitions, 5 changer transitions 0/170 dead transitions. [2023-01-27 18:15:03,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 170 transitions, 2235 flow [2023-01-27 18:15:03,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:15:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:15:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-01-27 18:15:03,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207439198855508 [2023-01-27 18:15:03,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-01-27 18:15:03,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-01-27 18:15:03,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:03,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-01-27 18:15:03,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:03,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:03,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:03,017 INFO L175 Difference]: Start difference. First operand has 84 places, 121 transitions, 1362 flow. Second operand 3 states and 364 transitions. [2023-01-27 18:15:03,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 170 transitions, 2235 flow [2023-01-27 18:15:03,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 170 transitions, 2074 flow, removed 49 selfloop flow, removed 4 redundant places. [2023-01-27 18:15:03,162 INFO L231 Difference]: Finished difference. Result has 81 places, 119 transitions, 1244 flow [2023-01-27 18:15:03,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1244, PETRI_PLACES=81, PETRI_TRANSITIONS=119} [2023-01-27 18:15:03,163 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-01-27 18:15:03,163 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 119 transitions, 1244 flow [2023-01-27 18:15:03,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:03,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:03,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:03,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:15:03,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:15:03,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:03,164 INFO L85 PathProgramCache]: Analyzing trace with hash -135853254, now seen corresponding path program 1 times [2023-01-27 18:15:03,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:03,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076399409] [2023-01-27 18:15:03,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:03,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:03,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:03,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076399409] [2023-01-27 18:15:03,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076399409] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:03,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:03,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:15:03,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645022128] [2023-01-27 18:15:03,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:03,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:15:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:03,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:15:03,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:15:03,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-01-27 18:15:03,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 119 transitions, 1244 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-27 18:15:03,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:03,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-01-27 18:15:03,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:03,994 INFO L130 PetriNetUnfolder]: 3418/5149 cut-off events. [2023-01-27 18:15:03,994 INFO L131 PetriNetUnfolder]: For 58793/59807 co-relation queries the response was YES. [2023-01-27 18:15:04,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31822 conditions, 5149 events. 3418/5149 cut-off events. For 58793/59807 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 27406 event pairs, 515 based on Foata normal form. 517/5484 useless extension candidates. Maximal degree in co-relation 31780. Up to 2537 conditions per place. [2023-01-27 18:15:04,027 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 170 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2023-01-27 18:15:04,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 200 transitions, 2487 flow [2023-01-27 18:15:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:15:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:15:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-01-27 18:15:04,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225321888412017 [2023-01-27 18:15:04,029 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-01-27 18:15:04,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-01-27 18:15:04,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:04,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-01-27 18:15:04,030 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-27 18:15:04,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:04,032 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:04,032 INFO L175 Difference]: Start difference. First operand has 81 places, 119 transitions, 1244 flow. Second operand 4 states and 487 transitions. [2023-01-27 18:15:04,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 200 transitions, 2487 flow [2023-01-27 18:15:04,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 2370 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-01-27 18:15:04,094 INFO L231 Difference]: Finished difference. Result has 81 places, 116 transitions, 1168 flow [2023-01-27 18:15:04,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1168, PETRI_PLACES=81, PETRI_TRANSITIONS=116} [2023-01-27 18:15:04,094 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-01-27 18:15:04,094 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 116 transitions, 1168 flow [2023-01-27 18:15:04,095 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-27 18:15:04,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:04,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:04,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 18:15:04,095 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:15:04,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:04,095 INFO L85 PathProgramCache]: Analyzing trace with hash -496757863, now seen corresponding path program 1 times [2023-01-27 18:15:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:04,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502908973] [2023-01-27 18:15:04,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:04,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:04,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502908973] [2023-01-27 18:15:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502908973] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:04,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:15:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480203232] [2023-01-27 18:15:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:04,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:15:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:15:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:15:04,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 233 [2023-01-27 18:15:04,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 116 transitions, 1168 flow. Second operand has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:04,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:04,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 233 [2023-01-27 18:15:04,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:05,786 INFO L130 PetriNetUnfolder]: 6298/9300 cut-off events. [2023-01-27 18:15:05,787 INFO L131 PetriNetUnfolder]: For 65544/65544 co-relation queries the response was YES. [2023-01-27 18:15:05,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53299 conditions, 9300 events. 6298/9300 cut-off events. For 65544/65544 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 49504 event pairs, 781 based on Foata normal form. 85/9385 useless extension candidates. Maximal degree in co-relation 53258. Up to 4246 conditions per place. [2023-01-27 18:15:05,836 INFO L137 encePairwiseOnDemand]: 219/233 looper letters, 163 selfloop transitions, 61 changer transitions 63/287 dead transitions. [2023-01-27 18:15:05,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 287 transitions, 3354 flow [2023-01-27 18:15:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 18:15:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 18:15:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 768 transitions. [2023-01-27 18:15:05,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47087676272225626 [2023-01-27 18:15:05,847 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 768 transitions. [2023-01-27 18:15:05,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 768 transitions. [2023-01-27 18:15:05,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:05,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 768 transitions. [2023-01-27 18:15:05,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:05,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:05,853 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:05,853 INFO L175 Difference]: Start difference. First operand has 81 places, 116 transitions, 1168 flow. Second operand 7 states and 768 transitions. [2023-01-27 18:15:05,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 287 transitions, 3354 flow [2023-01-27 18:15:05,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 287 transitions, 3296 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-01-27 18:15:05,928 INFO L231 Difference]: Finished difference. Result has 89 places, 141 transitions, 1674 flow [2023-01-27 18:15:05,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1674, PETRI_PLACES=89, PETRI_TRANSITIONS=141} [2023-01-27 18:15:05,928 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 45 predicate places. [2023-01-27 18:15:05,929 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 141 transitions, 1674 flow [2023-01-27 18:15:05,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:05,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:05,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:05,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 18:15:05,929 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:15:05,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1885198013, now seen corresponding path program 2 times [2023-01-27 18:15:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:05,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618326949] [2023-01-27 18:15:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:05,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:06,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:06,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618326949] [2023-01-27 18:15:06,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618326949] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:06,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:06,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:15:06,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991852876] [2023-01-27 18:15:06,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:06,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:15:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:06,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:15:06,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:15:06,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 233 [2023-01-27 18:15:06,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 141 transitions, 1674 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:06,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:06,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 233 [2023-01-27 18:15:06,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:07,484 INFO L130 PetriNetUnfolder]: 6471/10238 cut-off events. [2023-01-27 18:15:07,484 INFO L131 PetriNetUnfolder]: For 96584/97189 co-relation queries the response was YES. [2023-01-27 18:15:07,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63740 conditions, 10238 events. 6471/10238 cut-off events. For 96584/97189 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 64989 event pairs, 1499 based on Foata normal form. 229/10266 useless extension candidates. Maximal degree in co-relation 63695. Up to 4827 conditions per place. [2023-01-27 18:15:07,538 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 134 selfloop transitions, 13 changer transitions 53/214 dead transitions. [2023-01-27 18:15:07,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 214 transitions, 2850 flow [2023-01-27 18:15:07,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:15:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:15:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-01-27 18:15:07,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175965665236052 [2023-01-27 18:15:07,540 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-01-27 18:15:07,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-01-27 18:15:07,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:07,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-01-27 18:15:07,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:07,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:07,543 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:07,543 INFO L175 Difference]: Start difference. First operand has 89 places, 141 transitions, 1674 flow. Second operand 5 states and 603 transitions. [2023-01-27 18:15:07,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 214 transitions, 2850 flow [2023-01-27 18:15:07,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 214 transitions, 2836 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-01-27 18:15:07,680 INFO L231 Difference]: Finished difference. Result has 94 places, 122 transitions, 1445 flow [2023-01-27 18:15:07,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1445, PETRI_PLACES=94, PETRI_TRANSITIONS=122} [2023-01-27 18:15:07,681 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2023-01-27 18:15:07,681 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 122 transitions, 1445 flow [2023-01-27 18:15:07,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:07,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:07,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:07,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-27 18:15:07,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:15:07,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash -308495196, now seen corresponding path program 1 times [2023-01-27 18:15:07,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:07,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996512793] [2023-01-27 18:15:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:07,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:07,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996512793] [2023-01-27 18:15:07,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996512793] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:07,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:07,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:15:07,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686669502] [2023-01-27 18:15:07,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:07,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:15:07,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:07,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:15:07,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:15:07,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-01-27 18:15:07,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 122 transitions, 1445 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:07,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:07,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-01-27 18:15:07,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:08,874 INFO L130 PetriNetUnfolder]: 4357/6750 cut-off events. [2023-01-27 18:15:08,874 INFO L131 PetriNetUnfolder]: For 70876/71650 co-relation queries the response was YES. [2023-01-27 18:15:08,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41782 conditions, 6750 events. 4357/6750 cut-off events. For 70876/71650 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 40608 event pairs, 581 based on Foata normal form. 526/7087 useless extension candidates. Maximal degree in co-relation 41734. Up to 3188 conditions per place. [2023-01-27 18:15:08,917 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 159 selfloop transitions, 13 changer transitions 32/221 dead transitions. [2023-01-27 18:15:08,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 221 transitions, 3011 flow [2023-01-27 18:15:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:15:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:15:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-01-27 18:15:08,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218884120171674 [2023-01-27 18:15:08,919 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-01-27 18:15:08,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-01-27 18:15:08,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:08,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-01-27 18:15:08,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:08,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:08,923 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:08,923 INFO L175 Difference]: Start difference. First operand has 94 places, 122 transitions, 1445 flow. Second operand 5 states and 608 transitions. [2023-01-27 18:15:08,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 221 transitions, 3011 flow [2023-01-27 18:15:08,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 221 transitions, 2869 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-01-27 18:15:09,002 INFO L231 Difference]: Finished difference. Result has 90 places, 112 transitions, 1253 flow [2023-01-27 18:15:09,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1253, PETRI_PLACES=90, PETRI_TRANSITIONS=112} [2023-01-27 18:15:09,002 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places. [2023-01-27 18:15:09,002 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 112 transitions, 1253 flow [2023-01-27 18:15:09,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:09,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:09,003 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] [2023-01-27 18:15:09,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-27 18:15:09,003 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:15:09,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:09,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1848042883, now seen corresponding path program 1 times [2023-01-27 18:15:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:09,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015205142] [2023-01-27 18:15:09,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:09,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:09,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:09,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015205142] [2023-01-27 18:15:09,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015205142] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:09,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:09,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:15:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045184788] [2023-01-27 18:15:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:09,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:15:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:15:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:15:09,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-01-27 18:15:09,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 112 transitions, 1253 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:09,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:09,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-01-27 18:15:09,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:10,499 INFO L130 PetriNetUnfolder]: 5681/8997 cut-off events. [2023-01-27 18:15:10,500 INFO L131 PetriNetUnfolder]: For 84360/84827 co-relation queries the response was YES. [2023-01-27 18:15:10,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57452 conditions, 8997 events. 5681/8997 cut-off events. For 84360/84827 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 57020 event pairs, 1021 based on Foata normal form. 190/9032 useless extension candidates. Maximal degree in co-relation 57407. Up to 4818 conditions per place. [2023-01-27 18:15:10,557 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 149 selfloop transitions, 2 changer transitions 67/231 dead transitions. [2023-01-27 18:15:10,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 231 transitions, 2985 flow [2023-01-27 18:15:10,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:15:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:15:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-01-27 18:15:10,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5184549356223176 [2023-01-27 18:15:10,559 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-01-27 18:15:10,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-01-27 18:15:10,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:10,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-01-27 18:15:10,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:10,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:10,563 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:10,563 INFO L175 Difference]: Start difference. First operand has 90 places, 112 transitions, 1253 flow. Second operand 5 states and 604 transitions. [2023-01-27 18:15:10,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 231 transitions, 2985 flow [2023-01-27 18:15:10,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 231 transitions, 2885 flow, removed 23 selfloop flow, removed 4 redundant places. [2023-01-27 18:15:10,991 INFO L231 Difference]: Finished difference. Result has 93 places, 103 transitions, 1112 flow [2023-01-27 18:15:10,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1112, PETRI_PLACES=93, PETRI_TRANSITIONS=103} [2023-01-27 18:15:10,992 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2023-01-27 18:15:10,992 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 103 transitions, 1112 flow [2023-01-27 18:15:10,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:10,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:10,993 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] [2023-01-27 18:15:10,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-01-27 18:15:10,993 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:15:10,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 876477031, now seen corresponding path program 2 times [2023-01-27 18:15:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960556359] [2023-01-27 18:15:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:15:11,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 18:15:11,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:15:11,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960556359] [2023-01-27 18:15:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960556359] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:15:11,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:15:11,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:15:11,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896424242] [2023-01-27 18:15:11,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:15:11,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 18:15:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:15:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 18:15:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-27 18:15:11,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 233 [2023-01-27 18:15:11,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 103 transitions, 1112 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:11,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:15:11,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 233 [2023-01-27 18:15:11,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:15:12,298 INFO L130 PetriNetUnfolder]: 5123/7962 cut-off events. [2023-01-27 18:15:12,299 INFO L131 PetriNetUnfolder]: For 82782/83393 co-relation queries the response was YES. [2023-01-27 18:15:12,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49655 conditions, 7962 events. 5123/7962 cut-off events. For 82782/83393 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 50383 event pairs, 621 based on Foata normal form. 286/8049 useless extension candidates. Maximal degree in co-relation 49614. Up to 3850 conditions per place. [2023-01-27 18:15:12,333 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 56 selfloop transitions, 17 changer transitions 108/186 dead transitions. [2023-01-27 18:15:12,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 186 transitions, 2398 flow [2023-01-27 18:15:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:15:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:15:12,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-01-27 18:15:12,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5114449213161659 [2023-01-27 18:15:12,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-01-27 18:15:12,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-01-27 18:15:12,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:15:12,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-01-27 18:15:12,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:12,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:12,339 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:12,339 INFO L175 Difference]: Start difference. First operand has 93 places, 103 transitions, 1112 flow. Second operand 6 states and 715 transitions. [2023-01-27 18:15:12,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 186 transitions, 2398 flow [2023-01-27 18:15:12,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 186 transitions, 2288 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-01-27 18:15:12,621 INFO L231 Difference]: Finished difference. Result has 93 places, 52 transitions, 496 flow [2023-01-27 18:15:12,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=496, PETRI_PLACES=93, PETRI_TRANSITIONS=52} [2023-01-27 18:15:12,622 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2023-01-27 18:15:12,622 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 52 transitions, 496 flow [2023-01-27 18:15:12,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:15:12,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:15:12,623 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, 1, 1, 1] [2023-01-27 18:15:12,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-01-27 18:15:12,623 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 18:15:12,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:15:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash 845093863, now seen corresponding path program 1 times [2023-01-27 18:15:12,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:15:12,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183518488] [2023-01-27 18:15:12,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:15:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:15:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:15:12,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:15:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:15:12,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:15:12,764 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:15:12,765 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-01-27 18:15:12,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 18:15:12,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-01-27 18:15:12,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-01-27 18:15:12,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-01-27 18:15:12,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-01-27 18:15:12,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 18:15:12,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-27 18:15:12,770 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:15:12,776 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:15:12,776 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:15:12,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:15:12 BasicIcfg [2023-01-27 18:15:12,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:15:12,869 INFO L158 Benchmark]: Toolchain (without parser) took 37087.03ms. Allocated memory was 339.7MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 300.6MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. [2023-01-27 18:15:12,869 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 339.7MB. Free memory is still 287.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:15:12,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.06ms. Allocated memory is still 339.7MB. Free memory was 300.2MB in the beginning and 276.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-27 18:15:12,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.73ms. Allocated memory is still 339.7MB. Free memory was 276.5MB in the beginning and 273.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:15:12,870 INFO L158 Benchmark]: Boogie Preprocessor took 53.63ms. Allocated memory is still 339.7MB. Free memory was 273.8MB in the beginning and 271.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:15:12,870 INFO L158 Benchmark]: RCFGBuilder took 755.97ms. Allocated memory was 339.7MB in the beginning and 520.1MB in the end (delta: 180.4MB). Free memory was 271.6MB in the beginning and 482.2MB in the end (delta: -210.5MB). Peak memory consumption was 49.5MB. Max. memory is 16.0GB. [2023-01-27 18:15:12,871 INFO L158 Benchmark]: TraceAbstraction took 35594.29ms. Allocated memory was 520.1MB in the beginning and 3.7GB in the end (delta: 3.2GB). Free memory was 482.2MB in the beginning and 1.8GB in the end (delta: -1.3GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. [2023-01-27 18:15:12,872 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.12ms. Allocated memory is still 339.7MB. Free memory is still 287.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 596.06ms. Allocated memory is still 339.7MB. Free memory was 300.2MB in the beginning and 276.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 79.73ms. Allocated memory is still 339.7MB. Free memory was 276.5MB in the beginning and 273.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 53.63ms. Allocated memory is still 339.7MB. Free memory was 273.8MB in the beginning and 271.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 755.97ms. Allocated memory was 339.7MB in the beginning and 520.1MB in the end (delta: 180.4MB). Free memory was 271.6MB in the beginning and 482.2MB in the end (delta: -210.5MB). Peak memory consumption was 49.5MB. Max. memory is 16.0GB. * TraceAbstraction took 35594.29ms. Allocated memory was 520.1MB in the beginning and 3.7GB in the end (delta: 3.2GB). Free memory was 482.2MB in the beginning and 1.8GB in the end (delta: -1.3GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 135 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 32 TransitionsAfterwards, 3044 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 8921 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3359, independent: 3121, independent conditional: 0, independent unconditional: 3121, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1558, independent: 1521, independent conditional: 0, independent unconditional: 1521, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3359, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 1558, unknown conditional: 0, unknown unconditional: 1558] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((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(&t1481, ((void *)0), P0, ((void *)0))=-3, t1481={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((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(&t1482, ((void *)0), P1, ((void *)0))=-2, t1481={5:0}, t1482={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L850] 0 pthread_t t1483; [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y 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, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t1483, ((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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1483, ((void *)0), P2, ((void *)0))=-1, t1481={5:0}, t1482={6:0}, t1483={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L852] 0 pthread_t t1484; [L798] 3 y = 1 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, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 z = 1 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, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L853] FCALL, FORK 0 pthread_create(&t1484, ((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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1484, ((void *)0), P3, ((void *)0))=0, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L818] 4 z = 2 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L821] 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L804] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \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, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L881] 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=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, 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: 851]: 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: 849]: 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: 853]: 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: 847]: 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, 164 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: 35.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 691 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 691 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2441 IncrementalHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 48 mSDtfsCounter, 2441 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1674occurred in iteration=12, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 1764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-27 18:15:12,897 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...