/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:54:45,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:54:45,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:54:45,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:54:45,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:54:45,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:54:45,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:54:45,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:54:45,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:54:45,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:54:45,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:54:45,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:54:45,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:54:45,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:54:45,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:54:45,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:54:45,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:54:45,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:54:45,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:54:45,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:54:45,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:54:45,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:54:45,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:54:45,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:54:45,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:54:45,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:54:45,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:54:45,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:54:45,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:54:45,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:54:45,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:54:45,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:54:45,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:54:45,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:54:45,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:54:45,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:54:45,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:54:45,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:54:45,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:54:45,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:54:45,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:54:45,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:54:45,369 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:54:45,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:54:45,370 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:54:45,370 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:54:45,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:54:45,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:54:45,371 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:54:45,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:54:45,371 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:54:45,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:54:45,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:54:45,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:54:45,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:54:45,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:54:45,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:54:45,372 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:54:45,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:54:45,372 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:54:45,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:54:45,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:54:45,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:54:45,373 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:54:45,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:54:45,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:54:45,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:54:45,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:54:45,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:54:45,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:54:45,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:54:45,374 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:54:45,374 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:54:45,374 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:54:45,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:54:45,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:54:45,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:54:45,592 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:54:45,593 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:54:45,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2023-01-28 06:54:46,487 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:54:46,668 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:54:46,668 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2023-01-28 06:54:46,678 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f608e1868/01702b2dd48d416a9af906209945ee12/FLAGced932114 [2023-01-28 06:54:46,687 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f608e1868/01702b2dd48d416a9af906209945ee12 [2023-01-28 06:54:46,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:54:46,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:54:46,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:54:46,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:54:46,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:54:46,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:54:46" (1/1) ... [2023-01-28 06:54:46,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391df5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:46, skipping insertion in model container [2023-01-28 06:54:46,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:54:46" (1/1) ... [2023-01-28 06:54:46,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:54:46,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:54:46,814 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/mix031.opt.i[987,1000] [2023-01-28 06:54:46,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:54:47,012 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:54:47,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/mix031.opt.i[987,1000] [2023-01-28 06:54:47,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:54:47,125 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:54:47,125 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:54:47,129 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:54:47,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47 WrapperNode [2023-01-28 06:54:47,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:54:47,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:54:47,131 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:54:47,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:54:47,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (1/1) ... [2023-01-28 06:54:47,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (1/1) ... [2023-01-28 06:54:47,163 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-01-28 06:54:47,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:54:47,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:54:47,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:54:47,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:54:47,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (1/1) ... [2023-01-28 06:54:47,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (1/1) ... [2023-01-28 06:54:47,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (1/1) ... [2023-01-28 06:54:47,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (1/1) ... [2023-01-28 06:54:47,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (1/1) ... [2023-01-28 06:54:47,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (1/1) ... [2023-01-28 06:54:47,181 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (1/1) ... [2023-01-28 06:54:47,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (1/1) ... [2023-01-28 06:54:47,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:54:47,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:54:47,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:54:47,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:54:47,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (1/1) ... [2023-01-28 06:54:47,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:54:47,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:54:47,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:54:47,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:54:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:54:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:54:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:54:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:54:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:54:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:54:47,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:54:47,260 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:54:47,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:54:47,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:54:47,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:54:47,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:54:47,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:54:47,262 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:54:47,378 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:54:47,379 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:54:47,577 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:54:47,658 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:54:47,658 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:54:47,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:54:47 BoogieIcfgContainer [2023-01-28 06:54:47,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:54:47,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:54:47,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:54:47,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:54:47,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:54:46" (1/3) ... [2023-01-28 06:54:47,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665023a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:54:47, skipping insertion in model container [2023-01-28 06:54:47,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:54:47" (2/3) ... [2023-01-28 06:54:47,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665023a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:54:47, skipping insertion in model container [2023-01-28 06:54:47,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:54:47" (3/3) ... [2023-01-28 06:54:47,665 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2023-01-28 06:54:47,677 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:54:47,677 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:54:47,677 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:54:47,708 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:54:47,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 200 flow [2023-01-28 06:54:47,761 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2023-01-28 06:54:47,762 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:54:47,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-01-28 06:54:47,765 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 200 flow [2023-01-28 06:54:47,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 93 transitions, 192 flow [2023-01-28 06:54:47,770 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:54:47,777 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 192 flow [2023-01-28 06:54:47,779 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 192 flow [2023-01-28 06:54:47,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 192 flow [2023-01-28 06:54:47,794 INFO L130 PetriNetUnfolder]: 2/93 cut-off events. [2023-01-28 06:54:47,795 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:54:47,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-01-28 06:54:47,796 INFO L119 LiptonReduction]: Number of co-enabled transitions 1244 [2023-01-28 06:54:50,423 INFO L134 LiptonReduction]: Checked pairs total: 2778 [2023-01-28 06:54:50,423 INFO L136 LiptonReduction]: Total number of compositions: 88 [2023-01-28 06:54:50,438 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:54:50,442 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;@51053adc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:54:50,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 06:54:50,444 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-01-28 06:54:50,445 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:54:50,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:50,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 06:54:50,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:54:50,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:50,452 INFO L85 PathProgramCache]: Analyzing trace with hash 400970686, now seen corresponding path program 1 times [2023-01-28 06:54:50,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:50,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896407621] [2023-01-28 06:54:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:50,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:54:50,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:50,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896407621] [2023-01-28 06:54:50,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896407621] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:50,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:50,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:54:50,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103871716] [2023-01-28 06:54:50,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:50,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:54:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:50,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:54:50,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:54:50,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 183 [2023-01-28 06:54:50,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:50,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:50,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 183 [2023-01-28 06:54:50,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:50,945 INFO L130 PetriNetUnfolder]: 144/305 cut-off events. [2023-01-28 06:54:50,945 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 06:54:50,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 305 events. 144/305 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1297 event pairs, 24 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 566. Up to 196 conditions per place. [2023-01-28 06:54:50,949 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 19 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-01-28 06:54:50,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 102 flow [2023-01-28 06:54:50,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:54:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:54:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2023-01-28 06:54:50,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027322404371585 [2023-01-28 06:54:50,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 276 transitions. [2023-01-28 06:54:50,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 276 transitions. [2023-01-28 06:54:50,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:50,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 276 transitions. [2023-01-28 06:54:50,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:50,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:50,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:50,978 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 42 flow. Second operand 3 states and 276 transitions. [2023-01-28 06:54:50,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 102 flow [2023-01-28 06:54:50,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:54:50,983 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 40 flow [2023-01-28 06:54:50,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-01-28 06:54:50,987 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-01-28 06:54:50,987 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 40 flow [2023-01-28 06:54:50,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:50,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:50,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:50,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:54:50,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:54:50,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1214164090, now seen corresponding path program 1 times [2023-01-28 06:54:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:50,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882157771] [2023-01-28 06:54:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:54:51,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:51,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882157771] [2023-01-28 06:54:51,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882157771] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:51,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:51,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:54:51,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022082428] [2023-01-28 06:54:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:51,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:54:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:51,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:54:51,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:54:51,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 183 [2023-01-28 06:54:51,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:51,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 183 [2023-01-28 06:54:51,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:51,344 INFO L130 PetriNetUnfolder]: 167/294 cut-off events. [2023-01-28 06:54:51,345 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-01-28 06:54:51,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 294 events. 167/294 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 963 event pairs, 65 based on Foata normal form. 4/298 useless extension candidates. Maximal degree in co-relation 612. Up to 267 conditions per place. [2023-01-28 06:54:51,349 INFO L137 encePairwiseOnDemand]: 179/183 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-01-28 06:54:51,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 108 flow [2023-01-28 06:54:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:54:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:54:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-01-28 06:54:51,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4663023679417122 [2023-01-28 06:54:51,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-01-28 06:54:51,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-01-28 06:54:51,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:51,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-01-28 06:54:51,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,365 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 40 flow. Second operand 3 states and 256 transitions. [2023-01-28 06:54:51,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 108 flow [2023-01-28 06:54:51,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:54:51,366 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 55 flow [2023-01-28 06:54:51,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=55, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-01-28 06:54:51,367 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2023-01-28 06:54:51,367 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2023-01-28 06:54:51,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:51,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:51,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:54:51,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:54:51,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:51,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1963568488, now seen corresponding path program 1 times [2023-01-28 06:54:51,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:51,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447218820] [2023-01-28 06:54:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:51,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:54:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:51,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447218820] [2023-01-28 06:54:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447218820] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:51,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:51,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:54:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131674941] [2023-01-28 06:54:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:51,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:54:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:51,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:54:51,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:54:51,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 183 [2023-01-28 06:54:51,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:51,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 183 [2023-01-28 06:54:51,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:51,607 INFO L130 PetriNetUnfolder]: 157/278 cut-off events. [2023-01-28 06:54:51,607 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2023-01-28 06:54:51,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 278 events. 157/278 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 877 event pairs, 53 based on Foata normal form. 6/284 useless extension candidates. Maximal degree in co-relation 635. Up to 200 conditions per place. [2023-01-28 06:54:51,610 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2023-01-28 06:54:51,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 111 flow [2023-01-28 06:54:51,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:54:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:54:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2023-01-28 06:54:51,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46265938069216755 [2023-01-28 06:54:51,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 254 transitions. [2023-01-28 06:54:51,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 254 transitions. [2023-01-28 06:54:51,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:51,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 254 transitions. [2023-01-28 06:54:51,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,614 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 254 transitions. [2023-01-28 06:54:51,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 111 flow [2023-01-28 06:54:51,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 23 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:54:51,615 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 63 flow [2023-01-28 06:54:51,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-01-28 06:54:51,616 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2023-01-28 06:54:51,618 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 63 flow [2023-01-28 06:54:51,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:51,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:51,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:54:51,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:54:51,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:51,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1418155052, now seen corresponding path program 1 times [2023-01-28 06:54:51,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:51,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164990437] [2023-01-28 06:54:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:51,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:54:51,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:51,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164990437] [2023-01-28 06:54:51,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164990437] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:51,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:51,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:54:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503117530] [2023-01-28 06:54:51,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:51,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:54:51,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:51,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:54:51,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:54:51,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 183 [2023-01-28 06:54:51,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:51,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 183 [2023-01-28 06:54:51,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:51,890 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2023-01-28 06:54:51,890 INFO L131 PetriNetUnfolder]: For 91/91 co-relation queries the response was YES. [2023-01-28 06:54:51,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 256 events. 143/256 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 806 event pairs, 80 based on Foata normal form. 8/264 useless extension candidates. Maximal degree in co-relation 607. Up to 177 conditions per place. [2023-01-28 06:54:51,891 INFO L137 encePairwiseOnDemand]: 180/183 looper letters, 23 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-01-28 06:54:51,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 133 flow [2023-01-28 06:54:51,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:54:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:54:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2023-01-28 06:54:51,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681238615664845 [2023-01-28 06:54:51,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 257 transitions. [2023-01-28 06:54:51,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 257 transitions. [2023-01-28 06:54:51,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:51,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 257 transitions. [2023-01-28 06:54:51,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,899 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 63 flow. Second operand 3 states and 257 transitions. [2023-01-28 06:54:51,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 133 flow [2023-01-28 06:54:51,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:54:51,901 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 68 flow [2023-01-28 06:54:51,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-01-28 06:54:51,902 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-01-28 06:54:51,902 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 68 flow [2023-01-28 06:54:51,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:51,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:51,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:51,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:54:51,903 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:54:51,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1536345284, now seen corresponding path program 1 times [2023-01-28 06:54:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:51,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771189404] [2023-01-28 06:54:51,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:54:52,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771189404] [2023-01-28 06:54:52,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771189404] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:52,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:52,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:54:52,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504796091] [2023-01-28 06:54:52,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:52,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:54:52,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:52,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:54:52,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:54:52,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 183 [2023-01-28 06:54:52,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:52,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 183 [2023-01-28 06:54:52,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:52,123 INFO L130 PetriNetUnfolder]: 65/146 cut-off events. [2023-01-28 06:54:52,123 INFO L131 PetriNetUnfolder]: For 57/58 co-relation queries the response was YES. [2023-01-28 06:54:52,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 146 events. 65/146 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 482 event pairs, 14 based on Foata normal form. 23/167 useless extension candidates. Maximal degree in co-relation 355. Up to 58 conditions per place. [2023-01-28 06:54:52,124 INFO L137 encePairwiseOnDemand]: 178/183 looper letters, 21 selfloop transitions, 3 changer transitions 16/43 dead transitions. [2023-01-28 06:54:52,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 43 transitions, 220 flow [2023-01-28 06:54:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:54:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:54:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 435 transitions. [2023-01-28 06:54:52,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47540983606557374 [2023-01-28 06:54:52,126 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 435 transitions. [2023-01-28 06:54:52,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 435 transitions. [2023-01-28 06:54:52,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:52,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 435 transitions. [2023-01-28 06:54:52,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,128 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,128 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 68 flow. Second operand 5 states and 435 transitions. [2023-01-28 06:54:52,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 43 transitions, 220 flow [2023-01-28 06:54:52,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:54:52,130 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 89 flow [2023-01-28 06:54:52,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2023-01-28 06:54:52,130 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2023-01-28 06:54:52,130 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 89 flow [2023-01-28 06:54:52,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:52,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:52,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:54:52,131 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:54:52,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:52,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1385869629, now seen corresponding path program 1 times [2023-01-28 06:54:52,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:52,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118967801] [2023-01-28 06:54:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:54:52,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:52,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118967801] [2023-01-28 06:54:52,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118967801] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:52,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:52,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:54:52,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048703275] [2023-01-28 06:54:52,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:52,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:54:52,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:52,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:54:52,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:54:52,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 183 [2023-01-28 06:54:52,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:52,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 183 [2023-01-28 06:54:52,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:52,327 INFO L130 PetriNetUnfolder]: 27/75 cut-off events. [2023-01-28 06:54:52,327 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2023-01-28 06:54:52,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 75 events. 27/75 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 184 event pairs, 11 based on Foata normal form. 8/82 useless extension candidates. Maximal degree in co-relation 211. Up to 34 conditions per place. [2023-01-28 06:54:52,328 INFO L137 encePairwiseOnDemand]: 178/183 looper letters, 19 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2023-01-28 06:54:52,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 201 flow [2023-01-28 06:54:52,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:54:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:54:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2023-01-28 06:54:52,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46174863387978143 [2023-01-28 06:54:52,329 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 507 transitions. [2023-01-28 06:54:52,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 507 transitions. [2023-01-28 06:54:52,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:52,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 507 transitions. [2023-01-28 06:54:52,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,332 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,332 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 89 flow. Second operand 6 states and 507 transitions. [2023-01-28 06:54:52,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 201 flow [2023-01-28 06:54:52,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 174 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-01-28 06:54:52,333 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 88 flow [2023-01-28 06:54:52,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2023-01-28 06:54:52,334 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2023-01-28 06:54:52,334 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 88 flow [2023-01-28 06:54:52,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:52,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:52,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:54:52,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:54:52,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:52,335 INFO L85 PathProgramCache]: Analyzing trace with hash -592842891, now seen corresponding path program 1 times [2023-01-28 06:54:52,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:52,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474842911] [2023-01-28 06:54:52,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:54:52,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:52,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474842911] [2023-01-28 06:54:52,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474842911] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:52,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:52,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:54:52,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950176942] [2023-01-28 06:54:52,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:52,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:54:52,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:52,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:54:52,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:54:52,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 183 [2023-01-28 06:54:52,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:52,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 183 [2023-01-28 06:54:52,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:52,698 INFO L130 PetriNetUnfolder]: 37/104 cut-off events. [2023-01-28 06:54:52,698 INFO L131 PetriNetUnfolder]: For 87/88 co-relation queries the response was YES. [2023-01-28 06:54:52,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 104 events. 37/104 cut-off events. For 87/88 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 333 event pairs, 0 based on Foata normal form. 2/105 useless extension candidates. Maximal degree in co-relation 284. Up to 49 conditions per place. [2023-01-28 06:54:52,699 INFO L137 encePairwiseOnDemand]: 177/183 looper letters, 18 selfloop transitions, 1 changer transitions 24/44 dead transitions. [2023-01-28 06:54:52,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 275 flow [2023-01-28 06:54:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:54:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:54:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 505 transitions. [2023-01-28 06:54:52,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4599271402550091 [2023-01-28 06:54:52,700 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 505 transitions. [2023-01-28 06:54:52,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 505 transitions. [2023-01-28 06:54:52,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:52,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 505 transitions. [2023-01-28 06:54:52,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,703 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,703 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 88 flow. Second operand 6 states and 505 transitions. [2023-01-28 06:54:52,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 275 flow [2023-01-28 06:54:52,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 242 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-01-28 06:54:52,704 INFO L231 Difference]: Finished difference. Result has 36 places, 18 transitions, 81 flow [2023-01-28 06:54:52,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=18} [2023-01-28 06:54:52,705 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-01-28 06:54:52,705 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 18 transitions, 81 flow [2023-01-28 06:54:52,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:52,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:52,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:54:52,706 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:54:52,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1806005681, now seen corresponding path program 2 times [2023-01-28 06:54:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:52,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157192417] [2023-01-28 06:54:52,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:52,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:54:52,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-28 06:54:52,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:54:52,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157192417] [2023-01-28 06:54:52,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157192417] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:54:52,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:54:52,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:54:52,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803381013] [2023-01-28 06:54:52,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:54:52,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:54:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:54:52,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:54:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:54:52,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 183 [2023-01-28 06:54:52,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 18 transitions, 81 flow. Second operand has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:52,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:54:52,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 183 [2023-01-28 06:54:52,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:54:53,042 INFO L130 PetriNetUnfolder]: 10/47 cut-off events. [2023-01-28 06:54:53,042 INFO L131 PetriNetUnfolder]: For 46/47 co-relation queries the response was YES. [2023-01-28 06:54:53,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 47 events. 10/47 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 2 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 152. Up to 17 conditions per place. [2023-01-28 06:54:53,043 INFO L137 encePairwiseOnDemand]: 177/183 looper letters, 13 selfloop transitions, 4 changer transitions 10/29 dead transitions. [2023-01-28 06:54:53,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 189 flow [2023-01-28 06:54:53,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:54:53,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:54:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 563 transitions. [2023-01-28 06:54:53,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43950039032006244 [2023-01-28 06:54:53,045 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 563 transitions. [2023-01-28 06:54:53,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 563 transitions. [2023-01-28 06:54:53,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:54:53,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 563 transitions. [2023-01-28 06:54:53,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 80.42857142857143) internal successors, (563), 7 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:53,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:53,047 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:53,047 INFO L175 Difference]: Start difference. First operand has 36 places, 18 transitions, 81 flow. Second operand 7 states and 563 transitions. [2023-01-28 06:54:53,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 189 flow [2023-01-28 06:54:53,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 176 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-28 06:54:53,049 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 86 flow [2023-01-28 06:54:53,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2023-01-28 06:54:53,049 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2023-01-28 06:54:53,049 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 18 transitions, 86 flow [2023-01-28 06:54:53,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:54:53,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:54:53,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:53,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:54:53,050 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 06:54:53,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:54:53,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1360483241, now seen corresponding path program 3 times [2023-01-28 06:54:53,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:54:53,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191373302] [2023-01-28 06:54:53,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:54:53,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:54:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:54:53,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:54:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:54:53,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:54:53,102 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:54:53,102 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 06:54:53,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-28 06:54:53,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 06:54:53,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 06:54:53,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-28 06:54:53,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:54:53,104 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-01-28 06:54:53,108 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:54:53,108 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:54:53,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:54:53 BasicIcfg [2023-01-28 06:54:53,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:54:53,150 INFO L158 Benchmark]: Toolchain (without parser) took 6460.59ms. Allocated memory was 375.4MB in the beginning and 585.1MB in the end (delta: 209.7MB). Free memory was 311.7MB in the beginning and 338.5MB in the end (delta: -26.8MB). Peak memory consumption was 184.6MB. Max. memory is 16.0GB. [2023-01-28 06:54:53,150 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 375.4MB. Free memory is still 322.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:54:53,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.61ms. Allocated memory is still 375.4MB. Free memory was 311.4MB in the beginning and 289.2MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-28 06:54:53,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.08ms. Allocated memory is still 375.4MB. Free memory was 289.2MB in the beginning and 286.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 06:54:53,151 INFO L158 Benchmark]: Boogie Preprocessor took 19.68ms. Allocated memory is still 375.4MB. Free memory was 286.8MB in the beginning and 285.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:54:53,151 INFO L158 Benchmark]: RCFGBuilder took 475.65ms. Allocated memory was 375.4MB in the beginning and 585.1MB in the end (delta: 209.7MB). Free memory was 285.0MB in the beginning and 526.1MB in the end (delta: -241.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. [2023-01-28 06:54:53,151 INFO L158 Benchmark]: TraceAbstraction took 5488.85ms. Allocated memory is still 585.1MB. Free memory was 525.1MB in the beginning and 338.5MB in the end (delta: 186.6MB). Peak memory consumption was 187.7MB. Max. memory is 16.0GB. [2023-01-28 06:54:53,152 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 375.4MB. Free memory is still 322.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 439.61ms. Allocated memory is still 375.4MB. Free memory was 311.4MB in the beginning and 289.2MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.08ms. Allocated memory is still 375.4MB. Free memory was 289.2MB in the beginning and 286.8MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.68ms. Allocated memory is still 375.4MB. Free memory was 286.8MB in the beginning and 285.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 475.65ms. Allocated memory was 375.4MB in the beginning and 585.1MB in the end (delta: 209.7MB). Free memory was 285.0MB in the beginning and 526.1MB in the end (delta: -241.1MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. * TraceAbstraction took 5488.85ms. Allocated memory is still 585.1MB. Free memory was 525.1MB in the beginning and 338.5MB in the end (delta: 186.6MB). Peak memory consumption was 187.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 98 PlacesBefore, 25 PlacesAfterwards, 93 TransitionsBefore, 18 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 2778 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1466, independent: 1346, independent conditional: 0, independent unconditional: 1346, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 709, independent: 677, independent conditional: 0, independent unconditional: 677, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1466, independent: 669, independent conditional: 0, independent unconditional: 669, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 709, unknown conditional: 0, unknown unconditional: 709] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L823] 0 pthread_t t835; [L824] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t835, ((void *)0), P0, ((void *)0))=-1, t835={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t836; [L826] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t836, ((void *)0), P1, ((void *)0))=0, t835={5:0}, t836={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L781] 2 y$w_buff1 = y$w_buff0 [L782] 2 y$w_buff0 = 1 [L783] 2 y$w_buff1_used = y$w_buff0_used [L784] 2 y$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L786] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 2 y$r_buff0_thd2 = (_Bool)1 [L792] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L795] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L798] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L766] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EBX = y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t835={5:0}, t836={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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 5 procedures, 116 locations, 5 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: 5.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 411 IncrementalHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 6 mSDtfsCounter, 411 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:54:53,179 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...