./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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_a92b5769-8acf-4c75-bc73-41b6b7e3156b/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/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_a92b5769-8acf-4c75-bc73-41b6b7e3156b/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/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_a92b5769-8acf-4c75-bc73-41b6b7e3156b/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 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:45:18,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:45:18,657 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:45:18,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:45:18,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:45:18,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:45:18,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:45:18,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:45:18,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:45:18,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:45:18,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:45:18,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:45:18,692 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:45:18,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:45:18,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:45:18,703 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:45:18,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:45:18,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:45:18,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:45:18,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:45:18,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:45:18,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:45:18,707 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:45:18,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:45:18,708 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:45:18,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:45:18,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:45:18,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:45:18,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:18,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:45:18,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:45:18,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:45:18,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:45:18,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:45:18,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:45:18,713 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:45:18,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:45:18,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:45:18,714 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:45:18,714 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_a92b5769-8acf-4c75-bc73-41b6b7e3156b/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_a92b5769-8acf-4c75-bc73-41b6b7e3156b/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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2023-11-19 07:45:19,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:45:19,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:45:19,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:45:19,029 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:45:19,029 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:45:19,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:45:22,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:45:22,384 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:45:22,384 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:45:22,405 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/bin/uautomizer-verify-uCwYo4JHxu/data/09a973faa/1dd985aff8dd4b7a9bf066eae861dff8/FLAG153ec0089 [2023-11-19 07:45:22,421 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/bin/uautomizer-verify-uCwYo4JHxu/data/09a973faa/1dd985aff8dd4b7a9bf066eae861dff8 [2023-11-19 07:45:22,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:45:22,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:45:22,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:22,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:45:22,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:45:22,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:22" (1/1) ... [2023-11-19 07:45:22,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f9670b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:22, skipping insertion in model container [2023-11-19 07:45:22,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:22" (1/1) ... [2023-11-19 07:45:22,485 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:45:22,690 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_a92b5769-8acf-4c75-bc73-41b6b7e3156b/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2023-11-19 07:45:22,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:23,000 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:45:23,016 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_a92b5769-8acf-4c75-bc73-41b6b7e3156b/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1038,1051] [2023-11-19 07:45:23,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:23,124 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:45:23,124 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:45:23,132 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:45:23,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:23 WrapperNode [2023-11-19 07:45:23,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:23,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:23,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:45:23,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:45:23,144 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:45:23" (1/1) ... [2023-11-19 07:45:23,185 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:45:23" (1/1) ... [2023-11-19 07:45:23,231 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2023-11-19 07:45:23,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:23,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:45:23,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:45:23,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:45:23,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:23" (1/1) ... [2023-11-19 07:45:23,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:23" (1/1) ... [2023-11-19 07:45:23,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:23" (1/1) ... [2023-11-19 07:45:23,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:23" (1/1) ... [2023-11-19 07:45:23,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:23" (1/1) ... [2023-11-19 07:45:23,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:23" (1/1) ... [2023-11-19 07:45:23,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:23" (1/1) ... [2023-11-19 07:45:23,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:23" (1/1) ... [2023-11-19 07:45:23,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:45:23,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:45:23,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:45:23,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:45:23,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:23" (1/1) ... [2023-11-19 07:45:23,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:23,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:23,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/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:45:23,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/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:45:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:45:23,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:45:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:45:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:45:23,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:45:23,457 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:45:23,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:45:23,457 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:45:23,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:45:23,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:45:23,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:45:23,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:45:23,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:45:23,462 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:45:23,654 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:45:23,656 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:45:23,926 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:45:24,065 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:45:24,066 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:45:24,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:24 BoogieIcfgContainer [2023-11-19 07:45:24,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:45:24,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:45:24,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:45:24,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:45:24,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:45:22" (1/3) ... [2023-11-19 07:45:24,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4d46f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:24, skipping insertion in model container [2023-11-19 07:45:24,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:23" (2/3) ... [2023-11-19 07:45:24,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4d46f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:24, skipping insertion in model container [2023-11-19 07:45:24,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:24" (3/3) ... [2023-11-19 07:45:24,093 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-11-19 07:45:24,100 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:45:24,107 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:45:24,108 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:45:24,108 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:45:24,157 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:45:24,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 198 flow [2023-11-19 07:45:24,268 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2023-11-19 07:45:24,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:24,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-19 07:45:24,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 198 flow [2023-11-19 07:45:24,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 93 transitions, 192 flow [2023-11-19 07:45:24,289 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:45:24,308 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 192 flow [2023-11-19 07:45:24,313 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 192 flow [2023-11-19 07:45:24,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 192 flow [2023-11-19 07:45:24,365 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2023-11-19 07:45:24,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:24,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-11-19 07:45:24,369 INFO L119 LiptonReduction]: Number of co-enabled transitions 1388 [2023-11-19 07:45:28,470 INFO L134 LiptonReduction]: Checked pairs total: 2880 [2023-11-19 07:45:28,470 INFO L136 LiptonReduction]: Total number of compositions: 83 [2023-11-19 07:45:28,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:45:28,494 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;@423b088e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:45:28,494 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 07:45:28,498 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:45:28,498 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-19 07:45:28,499 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:28,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:28,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:45:28,500 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:45:28,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:28,506 INFO L85 PathProgramCache]: Analyzing trace with hash 400165492, now seen corresponding path program 1 times [2023-11-19 07:45:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:28,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292918511] [2023-11-19 07:45:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:28,963 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:45:28,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:28,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292918511] [2023-11-19 07:45:28,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292918511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:28,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:28,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:45:28,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552977949] [2023-11-19 07:45:28,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:28,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:45:28,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:29,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:45:29,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:45:29,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 178 [2023-11-19 07:45:29,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:29,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:29,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 178 [2023-11-19 07:45:29,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:29,137 INFO L124 PetriNetUnfolderBase]: 135/312 cut-off events. [2023-11-19 07:45:29,138 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:45:29,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 312 events. 135/312 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1390 event pairs, 21 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 556. Up to 187 conditions per place. [2023-11-19 07:45:29,143 INFO L140 encePairwiseOnDemand]: 174/178 looper letters, 19 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2023-11-19 07:45:29,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 104 flow [2023-11-19 07:45:29,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:29,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2023-11-19 07:45:29,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5205992509363296 [2023-11-19 07:45:29,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2023-11-19 07:45:29,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2023-11-19 07:45:29,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:29,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2023-11-19 07:45:29,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 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:45:29,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 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:45:29,183 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 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:45:29,185 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 278 transitions. [2023-11-19 07:45:29,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 104 flow [2023-11-19 07:45:29,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:29,197 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-11-19 07:45:29,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-11-19 07:45:29,206 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-11-19 07:45:29,206 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-11-19 07:45:29,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:29,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:29,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:29,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:45:29,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:45:29,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1497270387, now seen corresponding path program 1 times [2023-11-19 07:45:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:29,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486147813] [2023-11-19 07:45:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:29,560 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:45:29,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486147813] [2023-11-19 07:45:29,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486147813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:29,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:29,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:45:29,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283047623] [2023-11-19 07:45:29,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:29,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:29,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:29,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:29,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:29,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 178 [2023-11-19 07:45:29,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:45:29,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:29,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 178 [2023-11-19 07:45:29,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:29,856 INFO L124 PetriNetUnfolderBase]: 304/557 cut-off events. [2023-11-19 07:45:29,857 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-19 07:45:29,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 557 events. 304/557 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2519 event pairs, 70 based on Foata normal form. 43/600 useless extension candidates. Maximal degree in co-relation 1140. Up to 258 conditions per place. [2023-11-19 07:45:29,866 INFO L140 encePairwiseOnDemand]: 170/178 looper letters, 24 selfloop transitions, 6 changer transitions 18/48 dead transitions. [2023-11-19 07:45:29,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 48 transitions, 208 flow [2023-11-19 07:45:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:45:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:45:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 415 transitions. [2023-11-19 07:45:29,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46629213483146065 [2023-11-19 07:45:29,871 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 415 transitions. [2023-11-19 07:45:29,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 415 transitions. [2023-11-19 07:45:29,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:29,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 415 transitions. [2023-11-19 07:45:29,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 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:45:29,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:45:29,885 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:45:29,885 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 5 states and 415 transitions. [2023-11-19 07:45:29,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 48 transitions, 208 flow [2023-11-19 07:45:29,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 48 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:29,888 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 92 flow [2023-11-19 07:45:29,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-11-19 07:45:29,890 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2023-11-19 07:45:29,891 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 92 flow [2023-11-19 07:45:29,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:45:29,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:29,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:29,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:45:29,899 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:45:29,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:29,903 INFO L85 PathProgramCache]: Analyzing trace with hash 829238619, now seen corresponding path program 1 times [2023-11-19 07:45:29,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:29,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113812063] [2023-11-19 07:45:29,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:29,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:30,141 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:45:30,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:30,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113812063] [2023-11-19 07:45:30,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113812063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:30,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:30,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:30,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113423879] [2023-11-19 07:45:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:30,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:30,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:30,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:30,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:30,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 178 [2023-11-19 07:45:30,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:45:30,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:30,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 178 [2023-11-19 07:45:30,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:30,409 INFO L124 PetriNetUnfolderBase]: 238/450 cut-off events. [2023-11-19 07:45:30,409 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-11-19 07:45:30,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 450 events. 238/450 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1860 event pairs, 58 based on Foata normal form. 32/482 useless extension candidates. Maximal degree in co-relation 1281. Up to 149 conditions per place. [2023-11-19 07:45:30,415 INFO L140 encePairwiseOnDemand]: 171/178 looper letters, 24 selfloop transitions, 6 changer transitions 20/50 dead transitions. [2023-11-19 07:45:30,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 50 transitions, 300 flow [2023-11-19 07:45:30,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:45:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:45:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 559 transitions. [2023-11-19 07:45:30,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44863563402889245 [2023-11-19 07:45:30,419 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 559 transitions. [2023-11-19 07:45:30,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 559 transitions. [2023-11-19 07:45:30,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:30,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 559 transitions. [2023-11-19 07:45:30,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:30,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 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:45:30,427 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 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:45:30,427 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 92 flow. Second operand 7 states and 559 transitions. [2023-11-19 07:45:30,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 50 transitions, 300 flow [2023-11-19 07:45:30,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 50 transitions, 268 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:30,436 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 110 flow [2023-11-19 07:45:30,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2023-11-19 07:45:30,438 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-11-19 07:45:30,441 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 110 flow [2023-11-19 07:45:30,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:45:30,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:30,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:30,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:45:30,443 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:45:30,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:30,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1457417549, now seen corresponding path program 1 times [2023-11-19 07:45:30,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:30,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466176947] [2023-11-19 07:45:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:30,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:30,666 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:45:30,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:30,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466176947] [2023-11-19 07:45:30,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466176947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:30,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:30,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:30,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861066588] [2023-11-19 07:45:30,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:30,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:30,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:30,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:30,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 178 [2023-11-19 07:45:30,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 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:45:30,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:30,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 178 [2023-11-19 07:45:30,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:30,887 INFO L124 PetriNetUnfolderBase]: 195/369 cut-off events. [2023-11-19 07:45:30,887 INFO L125 PetriNetUnfolderBase]: For 538/538 co-relation queries the response was YES. [2023-11-19 07:45:30,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 369 events. 195/369 cut-off events. For 538/538 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1388 event pairs, 69 based on Foata normal form. 18/387 useless extension candidates. Maximal degree in co-relation 1097. Up to 150 conditions per place. [2023-11-19 07:45:30,891 INFO L140 encePairwiseOnDemand]: 172/178 looper letters, 24 selfloop transitions, 5 changer transitions 15/44 dead transitions. [2023-11-19 07:45:30,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 274 flow [2023-11-19 07:45:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:45:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:45:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 553 transitions. [2023-11-19 07:45:30,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4438202247191011 [2023-11-19 07:45:30,895 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 553 transitions. [2023-11-19 07:45:30,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 553 transitions. [2023-11-19 07:45:30,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:30,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 553 transitions. [2023-11-19 07:45:30,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:30,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 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:45:30,903 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 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:45:30,903 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 110 flow. Second operand 7 states and 553 transitions. [2023-11-19 07:45:30,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 274 flow [2023-11-19 07:45:30,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 261 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-11-19 07:45:30,908 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 131 flow [2023-11-19 07:45:30,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=131, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2023-11-19 07:45:30,909 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2023-11-19 07:45:30,909 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 131 flow [2023-11-19 07:45:30,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 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:45:30,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:30,910 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:30,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:45:30,911 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:45:30,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:30,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2063514748, now seen corresponding path program 1 times [2023-11-19 07:45:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:30,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532012162] [2023-11-19 07:45:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:30,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:31,054 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:45:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:31,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532012162] [2023-11-19 07:45:31,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532012162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:31,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:31,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:31,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000597961] [2023-11-19 07:45:31,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:31,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:31,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:31,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:31,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:31,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 178 [2023-11-19 07:45:31,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:45:31,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:31,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 178 [2023-11-19 07:45:31,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:31,187 INFO L124 PetriNetUnfolderBase]: 84/203 cut-off events. [2023-11-19 07:45:31,188 INFO L125 PetriNetUnfolderBase]: For 206/207 co-relation queries the response was YES. [2023-11-19 07:45:31,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 203 events. 84/203 cut-off events. For 206/207 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 789 event pairs, 16 based on Foata normal form. 32/234 useless extension candidates. Maximal degree in co-relation 619. Up to 93 conditions per place. [2023-11-19 07:45:31,190 INFO L140 encePairwiseOnDemand]: 173/178 looper letters, 22 selfloop transitions, 4 changer transitions 17/49 dead transitions. [2023-11-19 07:45:31,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 342 flow [2023-11-19 07:45:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:45:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:45:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 437 transitions. [2023-11-19 07:45:31,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4910112359550562 [2023-11-19 07:45:31,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 437 transitions. [2023-11-19 07:45:31,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 437 transitions. [2023-11-19 07:45:31,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:31,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 437 transitions. [2023-11-19 07:45:31,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:45:31,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:45:31,198 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:45:31,199 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 131 flow. Second operand 5 states and 437 transitions. [2023-11-19 07:45:31,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 342 flow [2023-11-19 07:45:31,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 319 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-19 07:45:31,202 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 147 flow [2023-11-19 07:45:31,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-19 07:45:31,204 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2023-11-19 07:45:31,204 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 147 flow [2023-11-19 07:45:31,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:45:31,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:31,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:31,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:45:31,205 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:45:31,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:31,206 INFO L85 PathProgramCache]: Analyzing trace with hash 626524976, now seen corresponding path program 1 times [2023-11-19 07:45:31,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:31,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279157855] [2023-11-19 07:45:31,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:31,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:31,387 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:45:31,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:31,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279157855] [2023-11-19 07:45:31,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279157855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:31,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:31,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:31,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606361104] [2023-11-19 07:45:31,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:31,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:31,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:31,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:31,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:31,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 178 [2023-11-19 07:45:31,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 0 states have call successors, (0), 0 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:45:31,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:31,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 178 [2023-11-19 07:45:31,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:31,609 INFO L124 PetriNetUnfolderBase]: 136/327 cut-off events. [2023-11-19 07:45:31,609 INFO L125 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2023-11-19 07:45:31,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 327 events. 136/327 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1530 event pairs, 44 based on Foata normal form. 4/328 useless extension candidates. Maximal degree in co-relation 1216. Up to 127 conditions per place. [2023-11-19 07:45:31,612 INFO L140 encePairwiseOnDemand]: 173/178 looper letters, 30 selfloop transitions, 3 changer transitions 19/53 dead transitions. [2023-11-19 07:45:31,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 383 flow [2023-11-19 07:45:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:45:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:45:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 420 transitions. [2023-11-19 07:45:31,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47191011235955055 [2023-11-19 07:45:31,615 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 420 transitions. [2023-11-19 07:45:31,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 420 transitions. [2023-11-19 07:45:31,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:31,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 420 transitions. [2023-11-19 07:45:31,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 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:45:31,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:45:31,620 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:45:31,620 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 147 flow. Second operand 5 states and 420 transitions. [2023-11-19 07:45:31,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 383 flow [2023-11-19 07:45:31,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 370 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:31,625 INFO L231 Difference]: Finished difference. Result has 42 places, 22 transitions, 126 flow [2023-11-19 07:45:31,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=22} [2023-11-19 07:45:31,626 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2023-11-19 07:45:31,626 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 22 transitions, 126 flow [2023-11-19 07:45:31,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 0 states have call successors, (0), 0 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:45:31,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:31,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:31,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:45:31,628 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:45:31,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2044372482, now seen corresponding path program 2 times [2023-11-19 07:45:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:31,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070798637] [2023-11-19 07:45:31,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:31,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:31,794 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:45:31,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:31,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070798637] [2023-11-19 07:45:31,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070798637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:31,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:31,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:31,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350468603] [2023-11-19 07:45:31,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:31,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:31,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:31,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:31,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:31,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 178 [2023-11-19 07:45:31,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 22 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 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:45:31,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:31,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 178 [2023-11-19 07:45:31,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:31,946 INFO L124 PetriNetUnfolderBase]: 67/176 cut-off events. [2023-11-19 07:45:31,946 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2023-11-19 07:45:31,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 176 events. 67/176 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 660 event pairs, 17 based on Foata normal form. 4/180 useless extension candidates. Maximal degree in co-relation 636. Up to 86 conditions per place. [2023-11-19 07:45:31,948 INFO L140 encePairwiseOnDemand]: 173/178 looper letters, 20 selfloop transitions, 3 changer transitions 14/37 dead transitions. [2023-11-19 07:45:31,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 269 flow [2023-11-19 07:45:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:45:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:45:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 398 transitions. [2023-11-19 07:45:31,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44719101123595506 [2023-11-19 07:45:31,976 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 398 transitions. [2023-11-19 07:45:31,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 398 transitions. [2023-11-19 07:45:31,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:31,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 398 transitions. [2023-11-19 07:45:31,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 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:45:31,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:45:31,981 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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:45:31,981 INFO L175 Difference]: Start difference. First operand has 42 places, 22 transitions, 126 flow. Second operand 5 states and 398 transitions. [2023-11-19 07:45:31,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 269 flow [2023-11-19 07:45:31,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 242 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-11-19 07:45:31,984 INFO L231 Difference]: Finished difference. Result has 38 places, 19 transitions, 97 flow [2023-11-19 07:45:31,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=38, PETRI_TRANSITIONS=19} [2023-11-19 07:45:31,986 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2023-11-19 07:45:31,986 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 19 transitions, 97 flow [2023-11-19 07:45:31,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 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:45:31,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:31,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:31,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:45:31,987 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:45:31,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1905974990, now seen corresponding path program 3 times [2023-11-19 07:45:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:31,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467025134] [2023-11-19 07:45:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:31,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:32,154 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:45:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:32,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467025134] [2023-11-19 07:45:32,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467025134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:32,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331692795] [2023-11-19 07:45:32,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:32,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:32,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:32,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:32,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 178 [2023-11-19 07:45:32,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 19 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:45:32,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:32,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 178 [2023-11-19 07:45:32,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:32,247 INFO L124 PetriNetUnfolderBase]: 10/39 cut-off events. [2023-11-19 07:45:32,247 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-19 07:45:32,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 39 events. 10/39 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 2 based on Foata normal form. 6/45 useless extension candidates. Maximal degree in co-relation 136. Up to 16 conditions per place. [2023-11-19 07:45:32,248 INFO L140 encePairwiseOnDemand]: 173/178 looper letters, 14 selfloop transitions, 5 changer transitions 6/28 dead transitions. [2023-11-19 07:45:32,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 199 flow [2023-11-19 07:45:32,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:45:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:45:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2023-11-19 07:45:32,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4747191011235955 [2023-11-19 07:45:32,251 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 507 transitions. [2023-11-19 07:45:32,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 507 transitions. [2023-11-19 07:45:32,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:32,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 507 transitions. [2023-11-19 07:45:32,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:32,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 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:45:32,257 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 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:45:32,257 INFO L175 Difference]: Start difference. First operand has 38 places, 19 transitions, 97 flow. Second operand 6 states and 507 transitions. [2023-11-19 07:45:32,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 199 flow [2023-11-19 07:45:32,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 133 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-11-19 07:45:32,259 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 77 flow [2023-11-19 07:45:32,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2023-11-19 07:45:32,260 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2023-11-19 07:45:32,260 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 77 flow [2023-11-19 07:45:32,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:45:32,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:32,261 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:45:32,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:45:32,262 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:45:32,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:32,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1307414406, now seen corresponding path program 1 times [2023-11-19 07:45:32,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:32,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489299221] [2023-11-19 07:45:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:32,821 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:45:32,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:32,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489299221] [2023-11-19 07:45:32,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489299221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:32,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:32,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:32,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214627732] [2023-11-19 07:45:32,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:32,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:45:32,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:45:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:45:32,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 178 [2023-11-19 07:45:32,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 77 flow. Second operand has 7 states, 7 states have (on average 77.0) internal successors, (539), 7 states have internal predecessors, (539), 0 states have call successors, (0), 0 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:45:32,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:32,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 178 [2023-11-19 07:45:32,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:32,994 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2023-11-19 07:45:32,994 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-19 07:45:32,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 36 events. 6/36 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 107. Up to 14 conditions per place. [2023-11-19 07:45:32,995 INFO L140 encePairwiseOnDemand]: 171/178 looper letters, 13 selfloop transitions, 4 changer transitions 9/29 dead transitions. [2023-11-19 07:45:32,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 185 flow [2023-11-19 07:45:32,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:45:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:45:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 623 transitions. [2023-11-19 07:45:32,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2023-11-19 07:45:32,999 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 623 transitions. [2023-11-19 07:45:32,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 623 transitions. [2023-11-19 07:45:33,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:33,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 623 transitions. [2023-11-19 07:45:33,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 77.875) internal successors, (623), 8 states have internal predecessors, (623), 0 states have call successors, (0), 0 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:45:33,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 178.0) internal successors, (1602), 9 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:45:33,008 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 178.0) internal successors, (1602), 9 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:45:33,008 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 77 flow. Second operand 8 states and 623 transitions. [2023-11-19 07:45:33,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 185 flow [2023-11-19 07:45:33,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 154 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-11-19 07:45:33,010 INFO L231 Difference]: Finished difference. Result has 37 places, 19 transitions, 77 flow [2023-11-19 07:45:33,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=19} [2023-11-19 07:45:33,011 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2023-11-19 07:45:33,012 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 19 transitions, 77 flow [2023-11-19 07:45:33,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.0) internal successors, (539), 7 states have internal predecessors, (539), 0 states have call successors, (0), 0 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:45:33,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:33,013 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:45:33,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:45:33,015 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-19 07:45:33,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash 212304652, now seen corresponding path program 2 times [2023-11-19 07:45:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:33,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600360352] [2023-11-19 07:45:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:33,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:45:33,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:45:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:45:33,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:45:33,165 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:45:33,166 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-19 07:45:33,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-19 07:45:33,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-19 07:45:33,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-19 07:45:33,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-19 07:45:33,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:45:33,170 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2023-11-19 07:45:33,176 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:45:33,176 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:45:33,213 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:45:33,215 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:45:33,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:45:33 BasicIcfg [2023-11-19 07:45:33,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:45:33,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:45:33,232 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:45:33,232 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:45:33,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:24" (3/4) ... [2023-11-19 07:45:33,234 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:45:33,252 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:45:33,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:45:33,313 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:45:33,313 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:45:33,313 INFO L158 Benchmark]: Toolchain (without parser) took 10888.51ms. Allocated memory was 123.7MB in the beginning and 192.9MB in the end (delta: 69.2MB). Free memory was 76.1MB in the beginning and 143.0MB in the end (delta: -66.8MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2023-11-19 07:45:33,314 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 123.7MB. Free memory was 93.0MB in the beginning and 93.0MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:45:33,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 707.31ms. Allocated memory is still 123.7MB. Free memory was 76.1MB in the beginning and 53.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:33,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.54ms. Allocated memory is still 123.7MB. Free memory was 53.4MB in the beginning and 51.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:33,315 INFO L158 Benchmark]: Boogie Preprocessor took 113.83ms. Allocated memory is still 123.7MB. Free memory was 51.0MB in the beginning and 49.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:33,315 INFO L158 Benchmark]: RCFGBuilder took 730.21ms. Allocated memory is still 123.7MB. Free memory was 49.2MB in the beginning and 70.5MB in the end (delta: -21.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2023-11-19 07:45:33,316 INFO L158 Benchmark]: TraceAbstraction took 9148.94ms. Allocated memory was 123.7MB in the beginning and 192.9MB in the end (delta: 69.2MB). Free memory was 69.9MB in the beginning and 150.3MB in the end (delta: -80.5MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2023-11-19 07:45:33,316 INFO L158 Benchmark]: Witness Printer took 81.09ms. Allocated memory is still 192.9MB. Free memory was 150.3MB in the beginning and 143.0MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 07:45:33,318 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.38ms. Allocated memory is still 123.7MB. Free memory was 93.0MB in the beginning and 93.0MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 707.31ms. Allocated memory is still 123.7MB. Free memory was 76.1MB in the beginning and 53.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.54ms. Allocated memory is still 123.7MB. Free memory was 53.4MB in the beginning and 51.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.83ms. Allocated memory is still 123.7MB. Free memory was 51.0MB in the beginning and 49.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 730.21ms. Allocated memory is still 123.7MB. Free memory was 49.2MB in the beginning and 70.5MB in the end (delta: -21.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9148.94ms. Allocated memory was 123.7MB in the beginning and 192.9MB in the end (delta: 69.2MB). Free memory was 69.9MB in the beginning and 150.3MB in the end (delta: -80.5MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. * Witness Printer took 81.09ms. Allocated memory is still 192.9MB. Free memory was 150.3MB in the beginning and 143.0MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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~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: 4.2s, 98 PlacesBefore, 26 PlacesAfterwards, 93 TransitionsBefore, 20 TransitionsAfterwards, 1388 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, 2880 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1525, independent: 1400, independent conditional: 0, independent unconditional: 1400, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 766, independent: 741, independent conditional: 0, independent unconditional: 741, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1525, independent: 659, independent conditional: 0, independent unconditional: 659, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 766, unknown conditional: 0, unknown unconditional: 766] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633={5:0}, t1634={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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 5 procedures, 116 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 350 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 761 IncrementalHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 46 mSDtfsCounter, 761 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=5, InterpolantAutomatonStates: 51, 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, 2.0s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 514 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:45:33,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92b5769-8acf-4c75-bc73-41b6b7e3156b/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