./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94656be5559ee6994f8d95e82c06571dfbe5b53833c4e842ade3fa022ec89a57 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:39:37,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:39:37,645 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:39:37,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:39:37,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:39:37,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:39:37,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:39:37,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:39:37,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:39:37,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:39:37,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:39:37,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:39:37,702 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:39:37,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:39:37,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:39:37,705 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:39:37,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:39:37,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:39:37,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:39:37,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:39:37,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:39:37,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:39:37,710 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:39:37,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:39:37,711 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:39:37,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:39:37,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:39:37,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:39:37,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:37,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:39:37,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:39:37,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:39:37,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:39:37,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:39:37,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:39:37,717 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:39:37,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:39:37,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:39:37,718 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:39:37,718 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94656be5559ee6994f8d95e82c06571dfbe5b53833c4e842ade3fa022ec89a57 [2023-11-19 07:39:37,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:39:38,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:39:38,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:39:38,016 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:39:38,016 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:39:38,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix042.opt.i [2023-11-19 07:39:41,180 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:39:41,461 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:39:41,462 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/sv-benchmarks/c/pthread-wmm/mix042.opt.i [2023-11-19 07:39:41,484 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/data/02fb4808e/2d5dc91ae76b4c8fb04da066704b07e7/FLAGb82acc09a [2023-11-19 07:39:41,499 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/data/02fb4808e/2d5dc91ae76b4c8fb04da066704b07e7 [2023-11-19 07:39:41,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:39:41,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:39:41,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:41,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:39:41,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:39:41,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:41" (1/1) ... [2023-11-19 07:39:41,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4cbffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:41, skipping insertion in model container [2023-11-19 07:39:41,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:39:41" (1/1) ... [2023-11-19 07:39:41,594 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:39:41,766 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/sv-benchmarks/c/pthread-wmm/mix042.opt.i[944,957] [2023-11-19 07:39:42,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:42,087 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:39:42,102 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/sv-benchmarks/c/pthread-wmm/mix042.opt.i[944,957] [2023-11-19 07:39:42,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:39:42,231 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:39:42,231 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:39:42,240 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:39:42,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42 WrapperNode [2023-11-19 07:39:42,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:39:42,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:42,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:39:42,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:39:42,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (1/1) ... [2023-11-19 07:39:42,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (1/1) ... [2023-11-19 07:39:42,340 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-11-19 07:39:42,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:39:42,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:39:42,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:39:42,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:39:42,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (1/1) ... [2023-11-19 07:39:42,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (1/1) ... [2023-11-19 07:39:42,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (1/1) ... [2023-11-19 07:39:42,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (1/1) ... [2023-11-19 07:39:42,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (1/1) ... [2023-11-19 07:39:42,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (1/1) ... [2023-11-19 07:39:42,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (1/1) ... [2023-11-19 07:39:42,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (1/1) ... [2023-11-19 07:39:42,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:39:42,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:39:42,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:39:42,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:39:42,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (1/1) ... [2023-11-19 07:39:42,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:39:42,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:39:42,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:39:42,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:39:42,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:39:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:39:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:39:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:39:42,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:39:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:39:42,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:39:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:39:42,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:39:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:39:42,516 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:39:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:39:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:39:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:39:42,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:39:42,519 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:39:42,712 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:39:42,714 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:39:43,076 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:39:43,265 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:39:43,265 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:39:43,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:43 BoogieIcfgContainer [2023-11-19 07:39:43,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:39:43,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:39:43,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:39:43,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:39:43,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:39:41" (1/3) ... [2023-11-19 07:39:43,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6dc49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:43, skipping insertion in model container [2023-11-19 07:39:43,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:39:42" (2/3) ... [2023-11-19 07:39:43,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6dc49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:39:43, skipping insertion in model container [2023-11-19 07:39:43,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:43" (3/3) ... [2023-11-19 07:39:43,282 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2023-11-19 07:39:43,292 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:39:43,304 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:39:43,304 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:39:43,304 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:39:43,382 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:39:43,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 242 flow [2023-11-19 07:39:43,519 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2023-11-19 07:39:43,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:39:43,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-19 07:39:43,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 242 flow [2023-11-19 07:39:43,535 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2023-11-19 07:39:43,540 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:39:43,564 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2023-11-19 07:39:43,573 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2023-11-19 07:39:43,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2023-11-19 07:39:43,626 INFO L124 PetriNetUnfolderBase]: 2/112 cut-off events. [2023-11-19 07:39:43,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:39:43,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-19 07:39:43,630 INFO L119 LiptonReduction]: Number of co-enabled transitions 2256 [2023-11-19 07:39:49,382 INFO L134 LiptonReduction]: Checked pairs total: 5185 [2023-11-19 07:39:49,382 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-11-19 07:39:49,399 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:39:49,406 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4e031db6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:39:49,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:39:49,413 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:39:49,413 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-11-19 07:39:49,413 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:39:49,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:49,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:49,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:49,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash -888819797, now seen corresponding path program 1 times [2023-11-19 07:39:49,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:49,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963262061] [2023-11-19 07:39:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:50,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:50,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963262061] [2023-11-19 07:39:50,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963262061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:50,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:50,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:39:50,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322562703] [2023-11-19 07:39:50,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:50,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:50,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:50,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:50,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:50,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 214 [2023-11-19 07:39:50,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:50,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:50,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 214 [2023-11-19 07:39:50,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:50,431 INFO L124 PetriNetUnfolderBase]: 644/1039 cut-off events. [2023-11-19 07:39:50,431 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:39:50,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2051 conditions, 1039 events. 644/1039 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4948 event pairs, 112 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 2040. Up to 773 conditions per place. [2023-11-19 07:39:50,450 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 24 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-11-19 07:39:50,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 127 flow [2023-11-19 07:39:50,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:39:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-11-19 07:39:50,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218068535825545 [2023-11-19 07:39:50,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-11-19 07:39:50,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-11-19 07:39:50,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:50,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-11-19 07:39:50,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:50,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:50,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:50,491 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 335 transitions. [2023-11-19 07:39:50,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 127 flow [2023-11-19 07:39:50,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:39:50,498 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-11-19 07:39:50,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-19 07:39:50,504 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-19 07:39:50,505 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-11-19 07:39:50,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:50,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:50,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:50,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:39:50,506 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:50,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:50,507 INFO L85 PathProgramCache]: Analyzing trace with hash 542721871, now seen corresponding path program 1 times [2023-11-19 07:39:50,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:50,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688378887] [2023-11-19 07:39:50,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:50,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:51,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:51,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688378887] [2023-11-19 07:39:51,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688378887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:51,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:51,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:39:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386673629] [2023-11-19 07:39:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:51,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:51,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 214 [2023-11-19 07:39:51,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:51,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:51,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 214 [2023-11-19 07:39:51,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:51,515 INFO L124 PetriNetUnfolderBase]: 775/1172 cut-off events. [2023-11-19 07:39:51,516 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-19 07:39:51,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 1172 events. 775/1172 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4685 event pairs, 263 based on Foata normal form. 32/1200 useless extension candidates. Maximal degree in co-relation 2424. Up to 817 conditions per place. [2023-11-19 07:39:51,526 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 26 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-11-19 07:39:51,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 124 flow [2023-11-19 07:39:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:39:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2023-11-19 07:39:51,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797507788161994 [2023-11-19 07:39:51,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2023-11-19 07:39:51,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2023-11-19 07:39:51,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:51,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2023-11-19 07:39:51,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:51,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:51,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:51,547 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 308 transitions. [2023-11-19 07:39:51,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 124 flow [2023-11-19 07:39:51,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:39:51,552 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2023-11-19 07:39:51,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-19 07:39:51,554 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-19 07:39:51,559 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2023-11-19 07:39:51,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:51,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:51,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:51,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:39:51,560 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:51,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:51,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1865170361, now seen corresponding path program 1 times [2023-11-19 07:39:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:51,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515430988] [2023-11-19 07:39:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:51,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:52,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:52,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515430988] [2023-11-19 07:39:52,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515430988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:52,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:52,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:52,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20994811] [2023-11-19 07:39:52,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:52,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:52,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:52,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:52,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 214 [2023-11-19 07:39:52,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:52,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:52,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 214 [2023-11-19 07:39:52,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:52,644 INFO L124 PetriNetUnfolderBase]: 642/1025 cut-off events. [2023-11-19 07:39:52,644 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-19 07:39:52,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 1025 events. 642/1025 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4607 event pairs, 102 based on Foata normal form. 9/1027 useless extension candidates. Maximal degree in co-relation 2201. Up to 725 conditions per place. [2023-11-19 07:39:52,653 INFO L140 encePairwiseOnDemand]: 207/214 looper letters, 39 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2023-11-19 07:39:52,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 220 flow [2023-11-19 07:39:52,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:39:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:39:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-11-19 07:39:52,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093457943925234 [2023-11-19 07:39:52,658 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-11-19 07:39:52,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-11-19 07:39:52,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:52,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-11-19 07:39:52,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:52,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:52,664 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:52,665 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 5 states and 545 transitions. [2023-11-19 07:39:52,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 220 flow [2023-11-19 07:39:52,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:39:52,669 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 115 flow [2023-11-19 07:39:52,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2023-11-19 07:39:52,670 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-11-19 07:39:52,670 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 115 flow [2023-11-19 07:39:52,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:52,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:52,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:52,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:39:52,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:52,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1864651421, now seen corresponding path program 2 times [2023-11-19 07:39:52,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:52,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929688736] [2023-11-19 07:39:52,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:52,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:53,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929688736] [2023-11-19 07:39:53,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929688736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:53,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:53,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:53,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516874760] [2023-11-19 07:39:53,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:53,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:53,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:53,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:53,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:53,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 214 [2023-11-19 07:39:53,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:53,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:53,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 214 [2023-11-19 07:39:53,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:53,634 INFO L124 PetriNetUnfolderBase]: 626/1003 cut-off events. [2023-11-19 07:39:53,634 INFO L125 PetriNetUnfolderBase]: For 561/576 co-relation queries the response was YES. [2023-11-19 07:39:53,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 1003 events. 626/1003 cut-off events. For 561/576 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4429 event pairs, 145 based on Foata normal form. 15/1017 useless extension candidates. Maximal degree in co-relation 2661. Up to 797 conditions per place. [2023-11-19 07:39:53,644 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 35 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-11-19 07:39:53,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 266 flow [2023-11-19 07:39:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:39:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2023-11-19 07:39:53,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058411214953271 [2023-11-19 07:39:53,647 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2023-11-19 07:39:53,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2023-11-19 07:39:53,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:53,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2023-11-19 07:39:53,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:53,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:53,653 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:53,653 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 115 flow. Second operand 4 states and 433 transitions. [2023-11-19 07:39:53,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 266 flow [2023-11-19 07:39:53,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 266 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:39:53,659 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 197 flow [2023-11-19 07:39:53,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-11-19 07:39:53,661 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2023-11-19 07:39:53,661 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 197 flow [2023-11-19 07:39:53,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:53,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:53,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:53,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:39:53,663 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:53,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:53,665 INFO L85 PathProgramCache]: Analyzing trace with hash -195033472, now seen corresponding path program 1 times [2023-11-19 07:39:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:53,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242782181] [2023-11-19 07:39:53,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:54,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:54,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242782181] [2023-11-19 07:39:54,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242782181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:54,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:54,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:54,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371130010] [2023-11-19 07:39:54,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:54,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:39:54,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:54,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:39:54,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:39:54,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 214 [2023-11-19 07:39:54,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:54,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:54,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 214 [2023-11-19 07:39:54,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:54,740 INFO L124 PetriNetUnfolderBase]: 689/1099 cut-off events. [2023-11-19 07:39:54,740 INFO L125 PetriNetUnfolderBase]: For 1158/1203 co-relation queries the response was YES. [2023-11-19 07:39:54,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3291 conditions, 1099 events. 689/1099 cut-off events. For 1158/1203 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5038 event pairs, 113 based on Foata normal form. 12/1110 useless extension candidates. Maximal degree in co-relation 3273. Up to 544 conditions per place. [2023-11-19 07:39:54,751 INFO L140 encePairwiseOnDemand]: 207/214 looper letters, 41 selfloop transitions, 17 changer transitions 0/60 dead transitions. [2023-11-19 07:39:54,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 393 flow [2023-11-19 07:39:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:39:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:39:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 526 transitions. [2023-11-19 07:39:54,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.491588785046729 [2023-11-19 07:39:54,755 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 526 transitions. [2023-11-19 07:39:54,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 526 transitions. [2023-11-19 07:39:54,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:54,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 526 transitions. [2023-11-19 07:39:54,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:54,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:54,762 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:54,762 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 197 flow. Second operand 5 states and 526 transitions. [2023-11-19 07:39:54,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 393 flow [2023-11-19 07:39:54,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 387 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-19 07:39:54,768 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 285 flow [2023-11-19 07:39:54,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2023-11-19 07:39:54,769 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2023-11-19 07:39:54,769 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 285 flow [2023-11-19 07:39:54,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:54,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:54,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:54,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:39:54,770 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:54,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1430851520, now seen corresponding path program 1 times [2023-11-19 07:39:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:54,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718427131] [2023-11-19 07:39:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:54,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:54,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:54,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718427131] [2023-11-19 07:39:54,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718427131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:54,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:54,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:39:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427933035] [2023-11-19 07:39:54,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:54,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:39:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:54,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:39:54,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:39:54,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 214 [2023-11-19 07:39:54,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:54,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:54,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 214 [2023-11-19 07:39:54,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:55,153 INFO L124 PetriNetUnfolderBase]: 366/630 cut-off events. [2023-11-19 07:39:55,154 INFO L125 PetriNetUnfolderBase]: For 1163/1192 co-relation queries the response was YES. [2023-11-19 07:39:55,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 630 events. 366/630 cut-off events. For 1163/1192 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2795 event pairs, 79 based on Foata normal form. 63/688 useless extension candidates. Maximal degree in co-relation 2124. Up to 502 conditions per place. [2023-11-19 07:39:55,162 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 51 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-11-19 07:39:55,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 516 flow [2023-11-19 07:39:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:39:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:39:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-11-19 07:39:55,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124610591900312 [2023-11-19 07:39:55,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-11-19 07:39:55,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-11-19 07:39:55,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:55,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-11-19 07:39:55,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:55,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:55,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:55,171 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 285 flow. Second operand 3 states and 329 transitions. [2023-11-19 07:39:55,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 516 flow [2023-11-19 07:39:55,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 495 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-19 07:39:55,177 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 297 flow [2023-11-19 07:39:55,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-11-19 07:39:55,178 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2023-11-19 07:39:55,178 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 297 flow [2023-11-19 07:39:55,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:55,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:55,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:55,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:39:55,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:55,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:55,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1264690507, now seen corresponding path program 1 times [2023-11-19 07:39:55,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:55,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477628310] [2023-11-19 07:39:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:55,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:55,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:55,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477628310] [2023-11-19 07:39:55,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477628310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:55,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:55,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:39:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601636868] [2023-11-19 07:39:55,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:55,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:39:55,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:55,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:39:55,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:39:55,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 214 [2023-11-19 07:39:55,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 297 flow. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:55,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:55,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 214 [2023-11-19 07:39:55,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:55,518 INFO L124 PetriNetUnfolderBase]: 176/339 cut-off events. [2023-11-19 07:39:55,519 INFO L125 PetriNetUnfolderBase]: For 583/604 co-relation queries the response was YES. [2023-11-19 07:39:55,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 339 events. 176/339 cut-off events. For 583/604 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1336 event pairs, 43 based on Foata normal form. 58/392 useless extension candidates. Maximal degree in co-relation 1218. Up to 116 conditions per place. [2023-11-19 07:39:55,524 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 52 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2023-11-19 07:39:55,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 489 flow [2023-11-19 07:39:55,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:39:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:39:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2023-11-19 07:39:55,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128504672897196 [2023-11-19 07:39:55,527 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2023-11-19 07:39:55,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2023-11-19 07:39:55,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:55,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2023-11-19 07:39:55,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:55,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:55,532 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:55,533 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 297 flow. Second operand 4 states and 439 transitions. [2023-11-19 07:39:55,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 489 flow [2023-11-19 07:39:55,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 465 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-19 07:39:55,537 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 231 flow [2023-11-19 07:39:55,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-11-19 07:39:55,538 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2023-11-19 07:39:55,538 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 231 flow [2023-11-19 07:39:55,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:55,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:55,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:55,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:39:55,540 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:55,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash -926763531, now seen corresponding path program 1 times [2023-11-19 07:39:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:55,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164059038] [2023-11-19 07:39:55,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:55,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:56,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:56,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164059038] [2023-11-19 07:39:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164059038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:56,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:56,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:56,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556366169] [2023-11-19 07:39:56,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:56,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:56,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:56,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:56,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:56,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 214 [2023-11-19 07:39:56,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:56,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:56,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 214 [2023-11-19 07:39:56,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:56,542 INFO L124 PetriNetUnfolderBase]: 358/661 cut-off events. [2023-11-19 07:39:56,542 INFO L125 PetriNetUnfolderBase]: For 1304/1320 co-relation queries the response was YES. [2023-11-19 07:39:56,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2422 conditions, 661 events. 358/661 cut-off events. For 1304/1320 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2947 event pairs, 48 based on Foata normal form. 25/681 useless extension candidates. Maximal degree in co-relation 2399. Up to 385 conditions per place. [2023-11-19 07:39:56,549 INFO L140 encePairwiseOnDemand]: 207/214 looper letters, 61 selfloop transitions, 10 changer transitions 21/95 dead transitions. [2023-11-19 07:39:56,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 95 transitions, 747 flow [2023-11-19 07:39:56,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:39:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:39:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2023-11-19 07:39:56,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471183800623053 [2023-11-19 07:39:56,553 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 605 transitions. [2023-11-19 07:39:56,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions. [2023-11-19 07:39:56,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:56,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions. [2023-11-19 07:39:56,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:56,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:56,560 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:56,560 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 231 flow. Second operand 6 states and 605 transitions. [2023-11-19 07:39:56,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 95 transitions, 747 flow [2023-11-19 07:39:56,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 95 transitions, 713 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-19 07:39:56,566 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 299 flow [2023-11-19 07:39:56,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-11-19 07:39:56,567 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2023-11-19 07:39:56,568 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 299 flow [2023-11-19 07:39:56,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:56,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:56,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:56,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:39:56,569 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:56,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:56,569 INFO L85 PathProgramCache]: Analyzing trace with hash -471735929, now seen corresponding path program 2 times [2023-11-19 07:39:56,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:56,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90928366] [2023-11-19 07:39:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:56,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:56,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:56,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90928366] [2023-11-19 07:39:56,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90928366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:56,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:56,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951971629] [2023-11-19 07:39:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:56,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:56,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:56,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:56,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 214 [2023-11-19 07:39:56,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:56,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:56,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 214 [2023-11-19 07:39:56,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:56,911 INFO L124 PetriNetUnfolderBase]: 195/393 cut-off events. [2023-11-19 07:39:56,911 INFO L125 PetriNetUnfolderBase]: For 868/892 co-relation queries the response was YES. [2023-11-19 07:39:56,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 393 events. 195/393 cut-off events. For 868/892 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1797 event pairs, 36 based on Foata normal form. 45/431 useless extension candidates. Maximal degree in co-relation 1441. Up to 157 conditions per place. [2023-11-19 07:39:56,915 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 40 selfloop transitions, 10 changer transitions 15/70 dead transitions. [2023-11-19 07:39:56,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 572 flow [2023-11-19 07:39:56,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:39:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:39:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-11-19 07:39:56,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502803738317757 [2023-11-19 07:39:56,919 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-11-19 07:39:56,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-11-19 07:39:56,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:56,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-11-19 07:39:56,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:56,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:56,924 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:56,925 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 299 flow. Second operand 5 states and 538 transitions. [2023-11-19 07:39:56,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 572 flow [2023-11-19 07:39:56,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 554 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-11-19 07:39:56,929 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 246 flow [2023-11-19 07:39:56,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-11-19 07:39:56,930 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2023-11-19 07:39:56,931 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 246 flow [2023-11-19 07:39:56,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:56,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:56,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:56,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:39:56,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:56,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:56,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1337214964, now seen corresponding path program 1 times [2023-11-19 07:39:56,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:56,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333445425] [2023-11-19 07:39:56,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:56,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:39:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:39:57,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:39:57,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333445425] [2023-11-19 07:39:57,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333445425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:39:57,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:39:57,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:39:57,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628991422] [2023-11-19 07:39:57,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:39:57,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:39:57,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:39:57,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:39:57,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:39:57,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 214 [2023-11-19 07:39:57,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:57,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:39:57,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 214 [2023-11-19 07:39:57,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:39:57,786 INFO L124 PetriNetUnfolderBase]: 209/415 cut-off events. [2023-11-19 07:39:57,786 INFO L125 PetriNetUnfolderBase]: For 986/995 co-relation queries the response was YES. [2023-11-19 07:39:57,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 415 events. 209/415 cut-off events. For 986/995 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1829 event pairs, 47 based on Foata normal form. 10/423 useless extension candidates. Maximal degree in co-relation 1632. Up to 209 conditions per place. [2023-11-19 07:39:57,790 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 31 selfloop transitions, 3 changer transitions 38/74 dead transitions. [2023-11-19 07:39:57,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 74 transitions, 616 flow [2023-11-19 07:39:57,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:39:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:39:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 593 transitions. [2023-11-19 07:39:57,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4618380062305296 [2023-11-19 07:39:57,794 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 593 transitions. [2023-11-19 07:39:57,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 593 transitions. [2023-11-19 07:39:57,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:39:57,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 593 transitions. [2023-11-19 07:39:57,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:57,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:57,804 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:57,804 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 246 flow. Second operand 6 states and 593 transitions. [2023-11-19 07:39:57,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 74 transitions, 616 flow [2023-11-19 07:39:57,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 521 flow, removed 21 selfloop flow, removed 9 redundant places. [2023-11-19 07:39:57,812 INFO L231 Difference]: Finished difference. Result has 54 places, 31 transitions, 162 flow [2023-11-19 07:39:57,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=54, PETRI_TRANSITIONS=31} [2023-11-19 07:39:57,814 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2023-11-19 07:39:57,814 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 31 transitions, 162 flow [2023-11-19 07:39:57,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:39:57,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:39:57,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:39:57,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:39:57,817 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:39:57,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:39:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash -93974312, now seen corresponding path program 2 times [2023-11-19 07:39:57,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:39:57,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634431263] [2023-11-19 07:39:57,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:39:57,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:39:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:39:57,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:39:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:39:57,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:39:57,981 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:39:57,982 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 07:39:57,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 07:39:57,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 07:39:57,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 07:39:57,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 07:39:57,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 07:39:57,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:39:57,985 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2023-11-19 07:39:57,991 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:39:57,992 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:39:58,067 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:39:58,069 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:39:58,070 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:39:58,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:39:58 BasicIcfg [2023-11-19 07:39:58,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:39:58,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:39:58,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:39:58,089 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:39:58,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:39:43" (3/4) ... [2023-11-19 07:39:58,090 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:39:58,109 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 07:39:58,110 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:39:58,110 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:39:58,184 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:39:58,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:39:58,185 INFO L158 Benchmark]: Toolchain (without parser) took 16680.62ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 159.9MB in the beginning and 247.5MB in the end (delta: -87.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2023-11-19 07:39:58,185 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 138.4MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:39:58,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.93ms. Allocated memory is still 205.5MB. Free memory was 159.9MB in the beginning and 136.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:39:58,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.69ms. Allocated memory is still 205.5MB. Free memory was 136.4MB in the beginning and 133.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:39:58,186 INFO L158 Benchmark]: Boogie Preprocessor took 79.90ms. Allocated memory is still 205.5MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:39:58,186 INFO L158 Benchmark]: RCFGBuilder took 845.79ms. Allocated memory is still 205.5MB. Free memory was 131.4MB in the beginning and 95.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-19 07:39:58,187 INFO L158 Benchmark]: TraceAbstraction took 14816.76ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 94.9MB in the beginning and 256.9MB in the end (delta: -162.0MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. [2023-11-19 07:39:58,187 INFO L158 Benchmark]: Witness Printer took 95.07ms. Allocated memory is still 297.8MB. Free memory was 256.9MB in the beginning and 247.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:39:58,189 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 138.4MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 735.93ms. Allocated memory is still 205.5MB. Free memory was 159.9MB in the beginning and 136.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.69ms. Allocated memory is still 205.5MB. Free memory was 136.4MB in the beginning and 133.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.90ms. Allocated memory is still 205.5MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 845.79ms. Allocated memory is still 205.5MB. Free memory was 131.4MB in the beginning and 95.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14816.76ms. Allocated memory was 205.5MB in the beginning and 297.8MB in the end (delta: 92.3MB). Free memory was 94.9MB in the beginning and 256.9MB in the end (delta: -162.0MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. * Witness Printer took 95.07ms. Allocated memory is still 297.8MB. Free memory was 256.9MB in the beginning and 247.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 120 PlacesBefore, 33 PlacesAfterwards, 112 TransitionsBefore, 23 TransitionsAfterwards, 2256 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 99 TotalNumberOfCompositions, 5185 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2528, independent: 2345, independent conditional: 0, independent unconditional: 2345, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1228, independent: 1193, independent conditional: 0, independent unconditional: 1193, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2528, independent: 1152, independent conditional: 0, independent unconditional: 1152, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 1228, unknown conditional: 0, unknown unconditional: 1228] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [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; [L825] 0 pthread_t t1108; [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1108={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L827] 0 pthread_t t1109; [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L829] 0 pthread_t t1110; [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L786] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L794] 3 z = 1 [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L768] 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) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 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 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 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) [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] 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 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3: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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a 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) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 815 IncrementalHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 38 mSDtfsCounter, 815 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=8, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 1034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-11-19 07:39:58,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81e4de64-49e6-4138-8130-c0349eb2b4d0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE