./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix004.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix004.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:56:05,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:56:05,821 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:56:05,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:56:05,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:56:05,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:56:05,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:56:05,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:56:05,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:56:05,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:56:05,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:56:05,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:56:05,861 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:56:05,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:56:05,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:56:05,863 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:56:05,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:56:05,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:56:05,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:56:05,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:56:05,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:56:05,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:56:05,867 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:56:05,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:56:05,868 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:56:05,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:56:05,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:56:05,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:56:05,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:56:05,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:56:05,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:56:05,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:56:05,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:56:05,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:56:05,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:56:05,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:56:05,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:56:05,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:56:05,873 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:56:05,873 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_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/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_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d [2023-11-06 22:56:06,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:56:06,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:56:06,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:56:06,257 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:56:06,257 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:56:06,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix004.opt.i [2023-11-06 22:56:09,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:56:09,867 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:56:09,868 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2023-11-06 22:56:09,893 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/data/d19cfa7c0/7865f390bda04ee0906f8d393ed3d9cb/FLAG9bf59832a [2023-11-06 22:56:09,920 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/data/d19cfa7c0/7865f390bda04ee0906f8d393ed3d9cb [2023-11-06 22:56:09,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:56:09,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:56:09,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:56:09,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:56:09,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:56:09,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:56:09" (1/1) ... [2023-11-06 22:56:09,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b62115f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:09, skipping insertion in model container [2023-11-06 22:56:09,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:56:09" (1/1) ... [2023-11-06 22:56:10,025 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:56:10,264 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_c45e0ea0-dd68-406a-a729-3e22f51ff74d/sv-benchmarks/c/pthread-wmm/mix004.opt.i[944,957] [2023-11-06 22:56:10,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:56:10,644 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:56:10,661 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_c45e0ea0-dd68-406a-a729-3e22f51ff74d/sv-benchmarks/c/pthread-wmm/mix004.opt.i[944,957] [2023-11-06 22:56:10,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:56:10,787 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:56:10,787 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:56:10,795 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:56:10,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10 WrapperNode [2023-11-06 22:56:10,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:56:10,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:56:10,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:56:10,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:56:10,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,900 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-11-06 22:56:10,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:56:10,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:56:10,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:56:10,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:56:10,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:56:10,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:56:10,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:56:10,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:56:10,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (1/1) ... [2023-11-06 22:56:10,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:56:10,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:56:11,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:56:11,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:56:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:56:11,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:56:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:56:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:56:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:56:11,059 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:56:11,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:56:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:56:11,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:56:11,060 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:56:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:56:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:56:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:56:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:56:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:56:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:56:11,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:56:11,065 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:56:11,250 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:56:11,252 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:56:11,679 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:56:11,964 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:56:11,965 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:56:11,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:11 BoogieIcfgContainer [2023-11-06 22:56:11,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:56:11,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:56:11,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:56:11,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:56:11,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:56:09" (1/3) ... [2023-11-06 22:56:11,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5632140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:56:11, skipping insertion in model container [2023-11-06 22:56:11,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:56:10" (2/3) ... [2023-11-06 22:56:11,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5632140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:56:11, skipping insertion in model container [2023-11-06 22:56:11,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:11" (3/3) ... [2023-11-06 22:56:11,984 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2023-11-06 22:56:11,993 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:56:12,006 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:56:12,006 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 22:56:12,006 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:56:12,094 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:56:12,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 284 flow [2023-11-06 22:56:12,255 INFO L124 PetriNetUnfolderBase]: 2/130 cut-off events. [2023-11-06 22:56:12,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:12,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-11-06 22:56:12,262 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 284 flow [2023-11-06 22:56:12,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2023-11-06 22:56:12,277 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:56:12,298 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2023-11-06 22:56:12,302 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2023-11-06 22:56:12,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2023-11-06 22:56:12,375 INFO L124 PetriNetUnfolderBase]: 2/130 cut-off events. [2023-11-06 22:56:12,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:12,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-11-06 22:56:12,380 INFO L119 LiptonReduction]: Number of co-enabled transitions 3060 [2023-11-06 22:56:18,240 INFO L134 LiptonReduction]: Checked pairs total: 7942 [2023-11-06 22:56:18,241 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-11-06 22:56:18,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:56:18,264 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@fd4e4a7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:56:18,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-06 22:56:18,276 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:56:18,276 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-11-06 22:56:18,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:56:18,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:18,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:18,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:18,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:18,285 INFO L85 PathProgramCache]: Analyzing trace with hash -341068117, now seen corresponding path program 1 times [2023-11-06 22:56:18,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:18,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346751257] [2023-11-06 22:56:18,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:18,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:18,914 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-06 22:56:18,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:18,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346751257] [2023-11-06 22:56:18,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346751257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:18,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:18,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:56:18,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184956786] [2023-11-06 22:56:18,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:18,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:56:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:18,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:56:18,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:56:18,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 249 [2023-11-06 22:56:18,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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-06 22:56:18,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:18,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 249 [2023-11-06 22:56:18,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:19,856 INFO L124 PetriNetUnfolderBase]: 2594/3787 cut-off events. [2023-11-06 22:56:19,857 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-06 22:56:19,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7482 conditions, 3787 events. 2594/3787 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20119 event pairs, 518 based on Foata normal form. 0/3594 useless extension candidates. Maximal degree in co-relation 7470. Up to 2797 conditions per place. [2023-11-06 22:56:19,896 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-11-06 22:56:19,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2023-11-06 22:56:19,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-11-06 22:56:19,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5314591700133868 [2023-11-06 22:56:19,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-11-06 22:56:19,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-11-06 22:56:19,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:19,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-11-06 22:56:19,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 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-06 22:56:19,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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-06 22:56:19,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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-06 22:56:19,945 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 397 transitions. [2023-11-06 22:56:19,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2023-11-06 22:56:19,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:56:19,955 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-11-06 22:56:19,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-06 22:56:19,962 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-06 22:56:19,963 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-11-06 22:56:19,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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-06 22:56:19,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:19,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:19,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:56:19,965 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:19,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1348854949, now seen corresponding path program 1 times [2023-11-06 22:56:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:19,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931293141] [2023-11-06 22:56:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:20,385 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-06 22:56:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:20,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931293141] [2023-11-06 22:56:20,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931293141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:20,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:20,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:56:20,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845923308] [2023-11-06 22:56:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:20,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:56:20,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:20,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:56:20,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:56:20,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:56:20,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-06 22:56:20,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:20,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:56:20,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:21,697 INFO L124 PetriNetUnfolderBase]: 5895/8000 cut-off events. [2023-11-06 22:56:21,697 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2023-11-06 22:56:21,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16518 conditions, 8000 events. 5895/8000 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 35077 event pairs, 2395 based on Foata normal form. 16/8016 useless extension candidates. Maximal degree in co-relation 16508. Up to 7809 conditions per place. [2023-11-06 22:56:21,770 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 37 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2023-11-06 22:56:21,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 188 flow [2023-11-06 22:56:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:21,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-11-06 22:56:21,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5033467202141901 [2023-11-06 22:56:21,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-11-06 22:56:21,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-11-06 22:56:21,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:21,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-11-06 22:56:21,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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-06 22:56:21,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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-06 22:56:21,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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-06 22:56:21,779 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 376 transitions. [2023-11-06 22:56:21,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 188 flow [2023-11-06 22:56:21,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:21,832 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 93 flow [2023-11-06 22:56:21,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-11-06 22:56:21,833 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-06 22:56:21,833 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 93 flow [2023-11-06 22:56:21,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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-06 22:56:21,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:21,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:21,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:56:21,834 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:21,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:21,835 INFO L85 PathProgramCache]: Analyzing trace with hash 324674981, now seen corresponding path program 1 times [2023-11-06 22:56:21,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:21,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989676751] [2023-11-06 22:56:21,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:22,123 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-06 22:56:22,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:22,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989676751] [2023-11-06 22:56:22,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989676751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:22,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:22,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:56:22,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377601053] [2023-11-06 22:56:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:22,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:22,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:22,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:22,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:22,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:56:22,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-06 22:56:22,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:22,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:56:22,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:23,294 INFO L124 PetriNetUnfolderBase]: 5431/7392 cut-off events. [2023-11-06 22:56:23,295 INFO L125 PetriNetUnfolderBase]: For 1384/1384 co-relation queries the response was YES. [2023-11-06 22:56:23,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17043 conditions, 7392 events. 5431/7392 cut-off events. For 1384/1384 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 31590 event pairs, 1667 based on Foata normal form. 144/7536 useless extension candidates. Maximal degree in co-relation 17032. Up to 5105 conditions per place. [2023-11-06 22:56:23,373 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-11-06 22:56:23,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 207 flow [2023-11-06 22:56:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:56:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:56:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-11-06 22:56:23,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979919678714859 [2023-11-06 22:56:23,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-11-06 22:56:23,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-11-06 22:56:23,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:23,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-11-06 22:56:23,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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-06 22:56:23,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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-06 22:56:23,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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-06 22:56:23,385 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 93 flow. Second operand 3 states and 372 transitions. [2023-11-06 22:56:23,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 207 flow [2023-11-06 22:56:23,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:23,388 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 99 flow [2023-11-06 22:56:23,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-06 22:56:23,389 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-11-06 22:56:23,389 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 99 flow [2023-11-06 22:56:23,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-06 22:56:23,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:23,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:23,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:56:23,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:23,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:23,392 INFO L85 PathProgramCache]: Analyzing trace with hash 760191585, now seen corresponding path program 1 times [2023-11-06 22:56:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:23,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82196655] [2023-11-06 22:56:23,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:23,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:24,377 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-06 22:56:24,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82196655] [2023-11-06 22:56:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82196655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:24,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945077696] [2023-11-06 22:56:24,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:24,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:56:24,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:24,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:56:24,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:56:24,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 249 [2023-11-06 22:56:24,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 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-06 22:56:24,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:24,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 249 [2023-11-06 22:56:24,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:25,491 INFO L124 PetriNetUnfolderBase]: 5095/6960 cut-off events. [2023-11-06 22:56:25,492 INFO L125 PetriNetUnfolderBase]: For 2168/2168 co-relation queries the response was YES. [2023-11-06 22:56:25,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16595 conditions, 6960 events. 5095/6960 cut-off events. For 2168/2168 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 30528 event pairs, 635 based on Foata normal form. 128/7088 useless extension candidates. Maximal degree in co-relation 16582. Up to 4561 conditions per place. [2023-11-06 22:56:25,540 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 63 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2023-11-06 22:56:25,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 380 flow [2023-11-06 22:56:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-11-06 22:56:25,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4891566265060241 [2023-11-06 22:56:25,544 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-11-06 22:56:25,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-11-06 22:56:25,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:25,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-11-06 22:56:25,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 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-06 22:56:25,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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-06 22:56:25,552 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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-06 22:56:25,552 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 99 flow. Second operand 5 states and 609 transitions. [2023-11-06 22:56:25,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 380 flow [2023-11-06 22:56:25,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 74 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:56:25,574 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 170 flow [2023-11-06 22:56:25,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-06 22:56:25,577 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-11-06 22:56:25,577 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 170 flow [2023-11-06 22:56:25,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 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-06 22:56:25,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:25,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:25,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:56:25,579 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:25,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:25,579 INFO L85 PathProgramCache]: Analyzing trace with hash -307024098, now seen corresponding path program 1 times [2023-11-06 22:56:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:25,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298739795] [2023-11-06 22:56:25,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:25,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:25,851 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-06 22:56:25,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:25,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298739795] [2023-11-06 22:56:25,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298739795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:25,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:25,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048832231] [2023-11-06 22:56:25,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:25,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:25,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:25,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:25,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:56:25,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 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-06 22:56:25,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:25,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:56:25,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:26,678 INFO L124 PetriNetUnfolderBase]: 2856/4361 cut-off events. [2023-11-06 22:56:26,678 INFO L125 PetriNetUnfolderBase]: For 2130/2151 co-relation queries the response was YES. [2023-11-06 22:56:26,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10716 conditions, 4361 events. 2856/4361 cut-off events. For 2130/2151 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 24350 event pairs, 525 based on Foata normal form. 364/4613 useless extension candidates. Maximal degree in co-relation 10700. Up to 2798 conditions per place. [2023-11-06 22:56:26,722 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 63 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2023-11-06 22:56:26,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 83 transitions, 463 flow [2023-11-06 22:56:26,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-11-06 22:56:26,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4971887550200803 [2023-11-06 22:56:26,726 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-11-06 22:56:26,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-11-06 22:56:26,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:26,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-11-06 22:56:26,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-06 22:56:26,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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-06 22:56:26,774 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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-06 22:56:26,774 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 170 flow. Second operand 5 states and 619 transitions. [2023-11-06 22:56:26,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 83 transitions, 463 flow [2023-11-06 22:56:26,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:26,785 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 229 flow [2023-11-06 22:56:26,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-11-06 22:56:26,789 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-11-06 22:56:26,789 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 229 flow [2023-11-06 22:56:26,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 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-06 22:56:26,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:26,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:26,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:56:26,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:26,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:26,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1952014629, now seen corresponding path program 1 times [2023-11-06 22:56:26,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:26,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314263191] [2023-11-06 22:56:26,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:26,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:27,224 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-06 22:56:27,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:27,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314263191] [2023-11-06 22:56:27,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314263191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:27,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:27,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:27,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917847355] [2023-11-06 22:56:27,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:27,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:27,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:27,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:56:27,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:56:27,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 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-06 22:56:27,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:27,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:56:27,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:28,216 INFO L124 PetriNetUnfolderBase]: 2317/3669 cut-off events. [2023-11-06 22:56:28,217 INFO L125 PetriNetUnfolderBase]: For 3854/3894 co-relation queries the response was YES. [2023-11-06 22:56:28,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11787 conditions, 3669 events. 2317/3669 cut-off events. For 3854/3894 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 21017 event pairs, 242 based on Foata normal form. 257/3832 useless extension candidates. Maximal degree in co-relation 11767. Up to 1362 conditions per place. [2023-11-06 22:56:28,264 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 85 selfloop transitions, 19 changer transitions 0/114 dead transitions. [2023-11-06 22:56:28,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 114 transitions, 732 flow [2023-11-06 22:56:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:56:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:56:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-11-06 22:56:28,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979919678714859 [2023-11-06 22:56:28,270 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-11-06 22:56:28,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-11-06 22:56:28,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:28,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-11-06 22:56:28,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 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-06 22:56:28,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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-06 22:56:28,281 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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-06 22:56:28,282 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 229 flow. Second operand 7 states and 868 transitions. [2023-11-06 22:56:28,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 114 transitions, 732 flow [2023-11-06 22:56:28,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 114 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:28,298 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 362 flow [2023-11-06 22:56:28,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2023-11-06 22:56:28,299 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-11-06 22:56:28,300 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 362 flow [2023-11-06 22:56:28,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 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-06 22:56:28,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:28,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:28,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:56:28,301 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:28,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1103427218, now seen corresponding path program 1 times [2023-11-06 22:56:28,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:28,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104201161] [2023-11-06 22:56:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:28,628 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-06 22:56:28,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:28,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104201161] [2023-11-06 22:56:28,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104201161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:28,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:28,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:56:28,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273523150] [2023-11-06 22:56:28,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:28,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:56:28,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:28,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:56:28,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:56:28,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:56:28,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 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-06 22:56:28,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:28,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:56:28,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:29,338 INFO L124 PetriNetUnfolderBase]: 2114/3370 cut-off events. [2023-11-06 22:56:29,339 INFO L125 PetriNetUnfolderBase]: For 6586/6649 co-relation queries the response was YES. [2023-11-06 22:56:29,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12830 conditions, 3370 events. 2114/3370 cut-off events. For 6586/6649 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 19329 event pairs, 194 based on Foata normal form. 115/3397 useless extension candidates. Maximal degree in co-relation 12806. Up to 1290 conditions per place. [2023-11-06 22:56:29,365 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 91 selfloop transitions, 28 changer transitions 9/138 dead transitions. [2023-11-06 22:56:29,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 138 transitions, 997 flow [2023-11-06 22:56:29,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:56:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:56:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1115 transitions. [2023-11-06 22:56:29,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49754573850959394 [2023-11-06 22:56:29,371 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1115 transitions. [2023-11-06 22:56:29,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1115 transitions. [2023-11-06 22:56:29,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:29,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1115 transitions. [2023-11-06 22:56:29,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 0 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-06 22:56:29,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 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-06 22:56:29,381 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 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-06 22:56:29,381 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 362 flow. Second operand 9 states and 1115 transitions. [2023-11-06 22:56:29,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 138 transitions, 997 flow [2023-11-06 22:56:29,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 138 transitions, 947 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-11-06 22:56:29,497 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 476 flow [2023-11-06 22:56:29,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=476, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2023-11-06 22:56:29,498 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2023-11-06 22:56:29,498 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 476 flow [2023-11-06 22:56:29,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 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-06 22:56:29,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:29,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:29,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:56:29,499 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:29,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:29,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1842465334, now seen corresponding path program 1 times [2023-11-06 22:56:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:29,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042532157] [2023-11-06 22:56:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:29,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:29,742 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-06 22:56:29,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:29,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042532157] [2023-11-06 22:56:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042532157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:29,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:29,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980308629] [2023-11-06 22:56:29,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:29,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:29,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:29,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:29,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:56:29,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 249 [2023-11-06 22:56:29,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 476 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 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-06 22:56:29,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:29,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 249 [2023-11-06 22:56:29,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:30,807 INFO L124 PetriNetUnfolderBase]: 4746/7006 cut-off events. [2023-11-06 22:56:30,807 INFO L125 PetriNetUnfolderBase]: For 18592/18592 co-relation queries the response was YES. [2023-11-06 22:56:30,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26589 conditions, 7006 events. 4746/7006 cut-off events. For 18592/18592 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 37331 event pairs, 543 based on Foata normal form. 9/7015 useless extension candidates. Maximal degree in co-relation 26562. Up to 3827 conditions per place. [2023-11-06 22:56:30,858 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 85 selfloop transitions, 12 changer transitions 78/175 dead transitions. [2023-11-06 22:56:30,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 175 transitions, 1640 flow [2023-11-06 22:56:30,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:56:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:56:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2023-11-06 22:56:30,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979919678714859 [2023-11-06 22:56:30,863 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2023-11-06 22:56:30,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2023-11-06 22:56:30,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:30,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2023-11-06 22:56:30,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 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-06 22:56:30,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 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-06 22:56:30,871 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 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-06 22:56:30,871 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 476 flow. Second operand 6 states and 744 transitions. [2023-11-06 22:56:30,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 175 transitions, 1640 flow [2023-11-06 22:56:31,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 175 transitions, 1369 flow, removed 94 selfloop flow, removed 4 redundant places. [2023-11-06 22:56:31,172 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 335 flow [2023-11-06 22:56:31,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2023-11-06 22:56:31,174 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2023-11-06 22:56:31,175 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 335 flow [2023-11-06 22:56:31,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 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-06 22:56:31,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:31,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:31,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:56:31,176 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:31,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash -963639416, now seen corresponding path program 2 times [2023-11-06 22:56:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:31,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262563850] [2023-11-06 22:56:31,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:31,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:31,450 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-06 22:56:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262563850] [2023-11-06 22:56:31,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262563850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:31,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256186960] [2023-11-06 22:56:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:31,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:31,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:31,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 249 [2023-11-06 22:56:31,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 335 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 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-06 22:56:31,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:31,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 249 [2023-11-06 22:56:31,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:31,998 INFO L124 PetriNetUnfolderBase]: 1879/3136 cut-off events. [2023-11-06 22:56:31,998 INFO L125 PetriNetUnfolderBase]: For 5201/5210 co-relation queries the response was YES. [2023-11-06 22:56:32,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10744 conditions, 3136 events. 1879/3136 cut-off events. For 5201/5210 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17834 event pairs, 450 based on Foata normal form. 10/3097 useless extension candidates. Maximal degree in co-relation 10714. Up to 1477 conditions per place. [2023-11-06 22:56:32,026 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 60 selfloop transitions, 2 changer transitions 31/102 dead transitions. [2023-11-06 22:56:32,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 838 flow [2023-11-06 22:56:32,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:56:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:56:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2023-11-06 22:56:32,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200803212851406 [2023-11-06 22:56:32,029 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2023-11-06 22:56:32,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2023-11-06 22:56:32,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:32,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2023-11-06 22:56:32,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 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-06 22:56:32,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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-06 22:56:32,034 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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-06 22:56:32,035 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 335 flow. Second operand 4 states and 518 transitions. [2023-11-06 22:56:32,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 838 flow [2023-11-06 22:56:32,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 102 transitions, 780 flow, removed 23 selfloop flow, removed 6 redundant places. [2023-11-06 22:56:32,069 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 309 flow [2023-11-06 22:56:32,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-06 22:56:32,070 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-11-06 22:56:32,070 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 309 flow [2023-11-06 22:56:32,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 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-06 22:56:32,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:32,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:32,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:56:32,071 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:32,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1903732610, now seen corresponding path program 3 times [2023-11-06 22:56:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:32,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754814269] [2023-11-06 22:56:32,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:32,451 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-06 22:56:32,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:32,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754814269] [2023-11-06 22:56:32,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754814269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:32,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:32,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:56:32,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074057745] [2023-11-06 22:56:32,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:32,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:56:32,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:32,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:56:32,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:56:32,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-11-06 22:56:32,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 309 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 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-06 22:56:32,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:32,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-11-06 22:56:32,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:33,079 INFO L124 PetriNetUnfolderBase]: 1523/2530 cut-off events. [2023-11-06 22:56:33,079 INFO L125 PetriNetUnfolderBase]: For 3383/3475 co-relation queries the response was YES. [2023-11-06 22:56:33,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8655 conditions, 2530 events. 1523/2530 cut-off events. For 3383/3475 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14677 event pairs, 234 based on Foata normal form. 99/2508 useless extension candidates. Maximal degree in co-relation 8628. Up to 905 conditions per place. [2023-11-06 22:56:33,092 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 55 selfloop transitions, 18 changer transitions 20/100 dead transitions. [2023-11-06 22:56:33,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 707 flow [2023-11-06 22:56:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:56:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:56:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 969 transitions. [2023-11-06 22:56:33,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864457831325301 [2023-11-06 22:56:33,097 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 969 transitions. [2023-11-06 22:56:33,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 969 transitions. [2023-11-06 22:56:33,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:33,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 969 transitions. [2023-11-06 22:56:33,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.125) internal successors, (969), 8 states have internal predecessors, (969), 0 states have call successors, (0), 0 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-06 22:56:33,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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-06 22:56:33,107 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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-06 22:56:33,108 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 309 flow. Second operand 8 states and 969 transitions. [2023-11-06 22:56:33,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 707 flow [2023-11-06 22:56:33,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 663 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-06 22:56:33,167 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 294 flow [2023-11-06 22:56:33,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=294, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2023-11-06 22:56:33,168 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2023-11-06 22:56:33,168 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 294 flow [2023-11-06 22:56:33,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 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-06 22:56:33,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:33,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:33,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:56:33,169 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:33,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1140142539, now seen corresponding path program 1 times [2023-11-06 22:56:33,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:33,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571200417] [2023-11-06 22:56:33,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:33,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:33,458 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-06 22:56:33,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:33,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571200417] [2023-11-06 22:56:33,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571200417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:33,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:33,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:56:33,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162201577] [2023-11-06 22:56:33,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:33,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:56:33,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:33,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:56:33,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:56:33,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 249 [2023-11-06 22:56:33,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 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-06 22:56:33,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:33,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 249 [2023-11-06 22:56:33,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:33,840 INFO L124 PetriNetUnfolderBase]: 1155/1891 cut-off events. [2023-11-06 22:56:33,840 INFO L125 PetriNetUnfolderBase]: For 4077/4077 co-relation queries the response was YES. [2023-11-06 22:56:33,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6926 conditions, 1891 events. 1155/1891 cut-off events. For 4077/4077 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9201 event pairs, 293 based on Foata normal form. 1/1892 useless extension candidates. Maximal degree in co-relation 6903. Up to 1259 conditions per place. [2023-11-06 22:56:33,853 INFO L140 encePairwiseOnDemand]: 240/249 looper letters, 68 selfloop transitions, 11 changer transitions 26/105 dead transitions. [2023-11-06 22:56:33,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 105 transitions, 878 flow [2023-11-06 22:56:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:56:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-11-06 22:56:33,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931726907630522 [2023-11-06 22:56:33,857 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-11-06 22:56:33,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-11-06 22:56:33,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:33,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-11-06 22:56:33,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 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-06 22:56:33,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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-06 22:56:33,863 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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-06 22:56:33,864 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 294 flow. Second operand 5 states and 614 transitions. [2023-11-06 22:56:33,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 105 transitions, 878 flow [2023-11-06 22:56:33,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 723 flow, removed 39 selfloop flow, removed 9 redundant places. [2023-11-06 22:56:33,882 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 300 flow [2023-11-06 22:56:33,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-06 22:56:33,883 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-11-06 22:56:33,883 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 300 flow [2023-11-06 22:56:33,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 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-06 22:56:33,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:33,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:33,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:56:33,884 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:33,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:33,885 INFO L85 PathProgramCache]: Analyzing trace with hash 23003665, now seen corresponding path program 2 times [2023-11-06 22:56:33,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:33,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255460328] [2023-11-06 22:56:33,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:33,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:34,174 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-06 22:56:34,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:34,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255460328] [2023-11-06 22:56:34,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255460328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:34,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:34,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:56:34,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721055031] [2023-11-06 22:56:34,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:34,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:34,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:34,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:34,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:56:34,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 249 [2023-11-06 22:56:34,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 300 flow. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 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-06 22:56:34,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:34,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 249 [2023-11-06 22:56:34,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:34,700 INFO L124 PetriNetUnfolderBase]: 1376/2256 cut-off events. [2023-11-06 22:56:34,700 INFO L125 PetriNetUnfolderBase]: For 4234/4234 co-relation queries the response was YES. [2023-11-06 22:56:34,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8082 conditions, 2256 events. 1376/2256 cut-off events. For 4234/4234 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11523 event pairs, 390 based on Foata normal form. 1/2257 useless extension candidates. Maximal degree in co-relation 8056. Up to 1139 conditions per place. [2023-11-06 22:56:34,707 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 37 selfloop transitions, 3 changer transitions 67/107 dead transitions. [2023-11-06 22:56:34,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 107 transitions, 796 flow [2023-11-06 22:56:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:56:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:56:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2023-11-06 22:56:34,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48460508701472554 [2023-11-06 22:56:34,711 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2023-11-06 22:56:34,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2023-11-06 22:56:34,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:34,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2023-11-06 22:56:34,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 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-06 22:56:34,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 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-06 22:56:34,719 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 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-06 22:56:34,719 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 300 flow. Second operand 6 states and 724 transitions. [2023-11-06 22:56:34,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 107 transitions, 796 flow [2023-11-06 22:56:34,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 107 transitions, 788 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-06 22:56:34,746 INFO L231 Difference]: Finished difference. Result has 67 places, 38 transitions, 208 flow [2023-11-06 22:56:34,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=67, PETRI_TRANSITIONS=38} [2023-11-06 22:56:34,747 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2023-11-06 22:56:34,747 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 38 transitions, 208 flow [2023-11-06 22:56:34,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 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-06 22:56:34,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:34,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:34,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:56:34,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:34,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1924553099, now seen corresponding path program 3 times [2023-11-06 22:56:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:34,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410212115] [2023-11-06 22:56:34,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:34,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:35,947 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-06 22:56:35,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:35,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410212115] [2023-11-06 22:56:35,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410212115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:56:35,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:56:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:56:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563587692] [2023-11-06 22:56:35,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:35,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:56:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:35,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:56:35,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:56:35,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 249 [2023-11-06 22:56:35,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 38 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 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-06 22:56:35,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:56:35,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 249 [2023-11-06 22:56:35,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:56:36,286 INFO L124 PetriNetUnfolderBase]: 390/706 cut-off events. [2023-11-06 22:56:36,286 INFO L125 PetriNetUnfolderBase]: For 1405/1458 co-relation queries the response was YES. [2023-11-06 22:56:36,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 706 events. 390/706 cut-off events. For 1405/1458 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3435 event pairs, 74 based on Foata normal form. 1/675 useless extension candidates. Maximal degree in co-relation 2492. Up to 303 conditions per place. [2023-11-06 22:56:36,289 INFO L140 encePairwiseOnDemand]: 242/249 looper letters, 38 selfloop transitions, 5 changer transitions 26/73 dead transitions. [2023-11-06 22:56:36,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 73 transitions, 540 flow [2023-11-06 22:56:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:56:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:56:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 952 transitions. [2023-11-06 22:56:36,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4779116465863454 [2023-11-06 22:56:36,293 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 952 transitions. [2023-11-06 22:56:36,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 952 transitions. [2023-11-06 22:56:36,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:56:36,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 952 transitions. [2023-11-06 22:56:36,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 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-06 22:56:36,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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-06 22:56:36,300 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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-06 22:56:36,301 INFO L175 Difference]: Start difference. First operand has 67 places, 38 transitions, 208 flow. Second operand 8 states and 952 transitions. [2023-11-06 22:56:36,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 73 transitions, 540 flow [2023-11-06 22:56:36,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 73 transitions, 517 flow, removed 2 selfloop flow, removed 9 redundant places. [2023-11-06 22:56:36,308 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 203 flow [2023-11-06 22:56:36,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=203, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2023-11-06 22:56:36,309 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-11-06 22:56:36,309 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 203 flow [2023-11-06 22:56:36,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.14285714285714) internal successors, (820), 7 states have internal predecessors, (820), 0 states have call successors, (0), 0 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-06 22:56:36,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:56:36,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:36,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:56:36,311 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 22:56:36,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:36,311 INFO L85 PathProgramCache]: Analyzing trace with hash 688984425, now seen corresponding path program 4 times [2023-11-06 22:56:36,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:36,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489424743] [2023-11-06 22:56:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:56:36,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:56:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:56:36,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:56:36,460 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:56:36,461 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-06 22:56:36,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-06 22:56:36,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-06 22:56:36,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-06 22:56:36,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-06 22:56:36,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-06 22:56:36,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-06 22:56:36,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:56:36,465 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:36,471 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:56:36,471 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:56:36,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:56:36 BasicIcfg [2023-11-06 22:56:36,559 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:56:36,560 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:56:36,560 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:56:36,560 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:56:36,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:56:11" (3/4) ... [2023-11-06 22:56:36,561 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 22:56:36,695 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:56:36,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:56:36,696 INFO L158 Benchmark]: Toolchain (without parser) took 26766.53ms. Allocated memory was 132.1MB in the beginning and 994.1MB in the end (delta: 861.9MB). Free memory was 91.2MB in the beginning and 304.4MB in the end (delta: -213.3MB). Peak memory consumption was 650.9MB. Max. memory is 16.1GB. [2023-11-06 22:56:36,696 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 132.1MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:56:36,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 862.06ms. Allocated memory is still 132.1MB. Free memory was 91.2MB in the beginning and 66.8MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 22:56:36,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.60ms. Allocated memory is still 132.1MB. Free memory was 66.8MB in the beginning and 63.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:56:36,697 INFO L158 Benchmark]: Boogie Preprocessor took 65.75ms. Allocated memory is still 132.1MB. Free memory was 63.9MB in the beginning and 61.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:56:36,698 INFO L158 Benchmark]: RCFGBuilder took 999.51ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 61.7MB in the beginning and 117.1MB in the end (delta: -55.4MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2023-11-06 22:56:36,700 INFO L158 Benchmark]: TraceAbstraction took 24586.81ms. Allocated memory was 174.1MB in the beginning and 994.1MB in the end (delta: 820.0MB). Free memory was 116.2MB in the beginning and 319.1MB in the end (delta: -202.9MB). Peak memory consumption was 617.9MB. Max. memory is 16.1GB. [2023-11-06 22:56:36,701 INFO L158 Benchmark]: Witness Printer took 135.59ms. Allocated memory is still 994.1MB. Free memory was 319.1MB in the beginning and 304.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:56:36,704 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.29ms. Allocated memory is still 132.1MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 862.06ms. Allocated memory is still 132.1MB. Free memory was 91.2MB in the beginning and 66.8MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.60ms. Allocated memory is still 132.1MB. Free memory was 66.8MB in the beginning and 63.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.75ms. Allocated memory is still 132.1MB. Free memory was 63.9MB in the beginning and 61.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 999.51ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 61.7MB in the beginning and 117.1MB in the end (delta: -55.4MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24586.81ms. Allocated memory was 174.1MB in the beginning and 994.1MB in the end (delta: 820.0MB). Free memory was 116.2MB in the beginning and 319.1MB in the end (delta: -202.9MB). Peak memory consumption was 617.9MB. Max. memory is 16.1GB. * Witness Printer took 135.59ms. Allocated memory is still 994.1MB. Free memory was 319.1MB in the beginning and 304.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 141 PlacesBefore, 41 PlacesAfterwards, 130 TransitionsBefore, 29 TransitionsAfterwards, 3060 CoEnabledTransitionPairs, 8 FixpointIterations, 44 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 7942 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3383, independent: 3140, independent conditional: 0, independent unconditional: 3140, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1651, independent: 1604, independent conditional: 0, independent unconditional: 1604, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3383, independent: 1536, independent conditional: 0, independent unconditional: 1536, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 1651, unknown conditional: 0, unknown unconditional: 1651] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t93; [L872] FCALL, FORK 0 pthread_create(&t93, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t93, ((void *)0), P0, ((void *)0))=-3, t93={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t94; [L874] FCALL, FORK 0 pthread_create(&t94, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t94, ((void *)0), P1, ((void *)0))=-2, t93={5:0}, t94={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t95; [L876] FCALL, FORK 0 pthread_create(&t95, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t95, ((void *)0), P2, ((void *)0))=-1, t93={5:0}, t94={6:0}, t95={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t96; [L878] FCALL, FORK 0 pthread_create(&t96, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t96, ((void *)0), P3, ((void *)0))=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EBX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 874]: 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: 876]: 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: 872]: 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 9 procedures, 169 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 703 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 583 mSDsluCounter, 234 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1534 IncrementalHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 66 mSDtfsCounter, 1534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=476occurred in iteration=7, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 1729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-06 22:56:36,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c45e0ea0-dd68-406a-a729-3e22f51ff74d/bin/uautomizer-verify-WvqO1wxjHP/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