./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:45:33,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:45:33,992 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:45:33,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:45:33,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:45:34,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:45:34,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:45:34,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:45:34,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:45:34,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:45:34,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:45:34,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:45:34,027 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:45:34,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:45:34,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:45:34,029 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:45:34,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:45:34,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:45:34,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:45:34,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:45:34,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:45:34,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:45:34,032 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:45:34,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:45:34,033 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:45:34,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:45:34,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:45:34,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:45:34,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:34,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:45:34,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:45:34,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:45:34,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:45:34,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:45:34,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:45:34,038 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:45:34,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:45:34,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:45:34,045 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:45:34,046 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_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 [2023-11-19 07:45:34,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:45:34,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:45:34,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:45:34,364 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:45:34,364 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:45:34,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix001.opt.i [2023-11-19 07:45:37,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:45:37,814 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:45:37,814 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/sv-benchmarks/c/pthread-wmm/mix001.opt.i [2023-11-19 07:45:37,837 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/data/42bff0800/9130765df1314222a13af17b1f8bb7da/FLAG616afa3cd [2023-11-19 07:45:37,857 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/data/42bff0800/9130765df1314222a13af17b1f8bb7da [2023-11-19 07:45:37,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:45:37,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:45:37,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:37,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:45:37,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:45:37,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:37" (1/1) ... [2023-11-19 07:45:37,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1675b634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:37, skipping insertion in model container [2023-11-19 07:45:37,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:45:37" (1/1) ... [2023-11-19 07:45:37,961 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:45:38,148 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_0c039e6d-cfef-4345-b7d5-166fd06706b2/sv-benchmarks/c/pthread-wmm/mix001.opt.i[944,957] [2023-11-19 07:45:38,456 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:38,474 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:45:38,488 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_0c039e6d-cfef-4345-b7d5-166fd06706b2/sv-benchmarks/c/pthread-wmm/mix001.opt.i[944,957] [2023-11-19 07:45:38,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:45:38,585 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:45:38,586 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:45:38,594 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:45:38,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38 WrapperNode [2023-11-19 07:45:38,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:45:38,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:38,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:45:38,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:45:38,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (1/1) ... [2023-11-19 07:45:38,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (1/1) ... [2023-11-19 07:45:38,698 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-11-19 07:45:38,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:45:38,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:45:38,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:45:38,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:45:38,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (1/1) ... [2023-11-19 07:45:38,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (1/1) ... [2023-11-19 07:45:38,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (1/1) ... [2023-11-19 07:45:38,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (1/1) ... [2023-11-19 07:45:38,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (1/1) ... [2023-11-19 07:45:38,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (1/1) ... [2023-11-19 07:45:38,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (1/1) ... [2023-11-19 07:45:38,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (1/1) ... [2023-11-19 07:45:38,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:45:38,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:45:38,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:45:38,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:45:38,782 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (1/1) ... [2023-11-19 07:45:38,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:45:38,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:45:38,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:45:38,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:45:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:45:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:45:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:45:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:45:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:45:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:45:38,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:45:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:45:38,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:45:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:45:38,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:45:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:45:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:45:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:45:38,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:45:38,877 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:45:39,032 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:45:39,034 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:45:39,455 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:45:39,684 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:45:39,685 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:45:39,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:39 BoogieIcfgContainer [2023-11-19 07:45:39,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:45:39,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:45:39,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:45:39,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:45:39,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:45:37" (1/3) ... [2023-11-19 07:45:39,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b2991fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:39, skipping insertion in model container [2023-11-19 07:45:39,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:45:38" (2/3) ... [2023-11-19 07:45:39,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b2991fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:45:39, skipping insertion in model container [2023-11-19 07:45:39,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:39" (3/3) ... [2023-11-19 07:45:39,711 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.opt.i [2023-11-19 07:45:39,722 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:45:39,734 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:45:39,734 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 07:45:39,734 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:45:39,819 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:45:39,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 248 flow [2023-11-19 07:45:39,944 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2023-11-19 07:45:39,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:39,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-11-19 07:45:39,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 248 flow [2023-11-19 07:45:39,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-11-19 07:45:39,960 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:45:39,971 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-11-19 07:45:39,974 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-11-19 07:45:39,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-11-19 07:45:40,012 INFO L124 PetriNetUnfolderBase]: 2/115 cut-off events. [2023-11-19 07:45:40,012 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:40,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-11-19 07:45:40,016 INFO L119 LiptonReduction]: Number of co-enabled transitions 2402 [2023-11-19 07:45:44,789 INFO L134 LiptonReduction]: Checked pairs total: 5839 [2023-11-19 07:45:44,789 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-11-19 07:45:44,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:45:44,814 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45f697ab, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:45:44,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:45:44,820 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:45:44,820 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-11-19 07:45:44,820 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:45:44,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:44,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:44,822 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:44,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash -553631768, now seen corresponding path program 1 times [2023-11-19 07:45:44,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:44,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750463151] [2023-11-19 07:45:44,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:44,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:45,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:45,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750463151] [2023-11-19 07:45:45,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750463151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:45,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:45,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:45:45,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702224783] [2023-11-19 07:45:45,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:45,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:45:45,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:45,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:45:45,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:45:45,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 222 [2023-11-19 07:45:45,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:45,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:45,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 222 [2023-11-19 07:45:45,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:45,814 INFO L124 PetriNetUnfolderBase]: 895/1420 cut-off events. [2023-11-19 07:45:45,815 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-19 07:45:45,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2803 conditions, 1420 events. 895/1420 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7003 event pairs, 159 based on Foata normal form. 0/1335 useless extension candidates. Maximal degree in co-relation 2792. Up to 1057 conditions per place. [2023-11-19 07:45:45,836 INFO L140 encePairwiseOnDemand]: 218/222 looper letters, 26 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-11-19 07:45:45,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 135 flow [2023-11-19 07:45:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-19 07:45:45,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225225225225225 [2023-11-19 07:45:45,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-19 07:45:45,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-19 07:45:45,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:45,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-19 07:45:45,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:45,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:45,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:45,874 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 348 transitions. [2023-11-19 07:45:45,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 135 flow [2023-11-19 07:45:45,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:45:45,881 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-11-19 07:45:45,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-11-19 07:45:45,887 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-19 07:45:45,887 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-11-19 07:45:45,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:45,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:45,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:45,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:45:45,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:45,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash 535861000, now seen corresponding path program 1 times [2023-11-19 07:45:45,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:45,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181037066] [2023-11-19 07:45:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:46,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:46,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181037066] [2023-11-19 07:45:46,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181037066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:46,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:46,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:45:46,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982981588] [2023-11-19 07:45:46,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:46,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:45:46,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:46,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:45:46,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:45:46,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-11-19 07:45:46,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:46,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:46,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-11-19 07:45:46,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:46,661 INFO L124 PetriNetUnfolderBase]: 1375/2028 cut-off events. [2023-11-19 07:45:46,662 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-11-19 07:45:46,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4218 conditions, 2028 events. 1375/2028 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8323 event pairs, 597 based on Foata normal form. 8/2036 useless extension candidates. Maximal degree in co-relation 4208. Up to 1953 conditions per place. [2023-11-19 07:45:46,677 INFO L140 encePairwiseOnDemand]: 217/222 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2023-11-19 07:45:46,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 152 flow [2023-11-19 07:45:46,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-11-19 07:45:46,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484984984984985 [2023-11-19 07:45:46,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-11-19 07:45:46,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-11-19 07:45:46,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:46,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-11-19 07:45:46,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:46,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:46,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:46,698 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 323 transitions. [2023-11-19 07:45:46,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 152 flow [2023-11-19 07:45:46,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:46,703 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 76 flow [2023-11-19 07:45:46,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2023-11-19 07:45:46,705 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-11-19 07:45:46,713 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 76 flow [2023-11-19 07:45:46,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:46,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:46,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:46,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:45:46,715 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:46,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash -558501918, now seen corresponding path program 1 times [2023-11-19 07:45:46,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:46,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142624629] [2023-11-19 07:45:46,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:46,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:46,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:46,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142624629] [2023-11-19 07:45:46,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142624629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:46,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:45:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780184602] [2023-11-19 07:45:46,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:46,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:46,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:46,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:46,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-11-19 07:45:46,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:46,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:46,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-11-19 07:45:46,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:47,340 INFO L124 PetriNetUnfolderBase]: 1269/1880 cut-off events. [2023-11-19 07:45:47,340 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2023-11-19 07:45:47,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 1880 events. 1269/1880 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7457 event pairs, 405 based on Foata normal form. 42/1922 useless extension candidates. Maximal degree in co-relation 4279. Up to 1316 conditions per place. [2023-11-19 07:45:47,357 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-11-19 07:45:47,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 170 flow [2023-11-19 07:45:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-11-19 07:45:47,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481981981981982 [2023-11-19 07:45:47,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-11-19 07:45:47,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-11-19 07:45:47,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:47,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-11-19 07:45:47,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:47,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:47,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:47,365 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 76 flow. Second operand 3 states and 321 transitions. [2023-11-19 07:45:47,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 170 flow [2023-11-19 07:45:47,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:45:47,367 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 83 flow [2023-11-19 07:45:47,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-11-19 07:45:47,368 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2023-11-19 07:45:47,368 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 83 flow [2023-11-19 07:45:47,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:47,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:47,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:47,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:45:47,369 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:47,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:47,370 INFO L85 PathProgramCache]: Analyzing trace with hash -461706119, now seen corresponding path program 1 times [2023-11-19 07:45:47,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:47,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472119390] [2023-11-19 07:45:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:47,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:47,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472119390] [2023-11-19 07:45:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472119390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:47,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:47,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:45:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487944754] [2023-11-19 07:45:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:47,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:47,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:47,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:47,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:47,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-11-19 07:45:47,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:47,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:47,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-11-19 07:45:47,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:47,940 INFO L124 PetriNetUnfolderBase]: 1167/1738 cut-off events. [2023-11-19 07:45:47,941 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2023-11-19 07:45:47,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4104 conditions, 1738 events. 1167/1738 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6894 event pairs, 726 based on Foata normal form. 40/1778 useless extension candidates. Maximal degree in co-relation 4091. Up to 1181 conditions per place. [2023-11-19 07:45:47,958 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-11-19 07:45:47,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 204 flow [2023-11-19 07:45:47,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-11-19 07:45:47,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894894894894895 [2023-11-19 07:45:47,961 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-11-19 07:45:47,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-11-19 07:45:47,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:47,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-11-19 07:45:47,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:47,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:47,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:47,967 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 83 flow. Second operand 3 states and 326 transitions. [2023-11-19 07:45:47,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 204 flow [2023-11-19 07:45:47,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:47,971 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 88 flow [2023-11-19 07:45:47,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-11-19 07:45:47,973 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-11-19 07:45:47,973 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 88 flow [2023-11-19 07:45:47,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:47,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:47,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:47,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:45:47,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:47,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:47,976 INFO L85 PathProgramCache]: Analyzing trace with hash -716032177, now seen corresponding path program 1 times [2023-11-19 07:45:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:47,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062827674] [2023-11-19 07:45:47,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:47,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:48,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:48,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062827674] [2023-11-19 07:45:48,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062827674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:48,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:48,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:45:48,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396708004] [2023-11-19 07:45:48,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:48,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:48,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:48,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:48,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:48,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 222 [2023-11-19 07:45:48,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 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-19 07:45:48,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:48,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 222 [2023-11-19 07:45:48,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:48,566 INFO L124 PetriNetUnfolderBase]: 1109/1656 cut-off events. [2023-11-19 07:45:48,567 INFO L125 PetriNetUnfolderBase]: For 689/689 co-relation queries the response was YES. [2023-11-19 07:45:48,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4046 conditions, 1656 events. 1109/1656 cut-off events. For 689/689 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6727 event pairs, 407 based on Foata normal form. 24/1680 useless extension candidates. Maximal degree in co-relation 4032. Up to 1087 conditions per place. [2023-11-19 07:45:48,583 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 35 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2023-11-19 07:45:48,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 200 flow [2023-11-19 07:45:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:45:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:45:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-11-19 07:45:48,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2023-11-19 07:45:48,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-11-19 07:45:48,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-11-19 07:45:48,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:48,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-11-19 07:45:48,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:48,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:48,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:48,591 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 88 flow. Second operand 3 states and 324 transitions. [2023-11-19 07:45:48,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 200 flow [2023-11-19 07:45:48,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:48,594 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 93 flow [2023-11-19 07:45:48,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-11-19 07:45:48,595 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-11-19 07:45:48,595 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 93 flow [2023-11-19 07:45:48,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 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-19 07:45:48,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:48,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:48,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:45:48,597 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:48,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:48,598 INFO L85 PathProgramCache]: Analyzing trace with hash 890933754, now seen corresponding path program 1 times [2023-11-19 07:45:48,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:48,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928435777] [2023-11-19 07:45:48,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:48,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:48,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:48,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928435777] [2023-11-19 07:45:48,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928435777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:48,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:48,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:48,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270005502] [2023-11-19 07:45:48,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:48,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:48,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:48,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:48,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:48,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-11-19 07:45:48,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:48,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:48,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-11-19 07:45:48,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:49,149 INFO L124 PetriNetUnfolderBase]: 583/1000 cut-off events. [2023-11-19 07:45:49,150 INFO L125 PetriNetUnfolderBase]: For 221/226 co-relation queries the response was YES. [2023-11-19 07:45:49,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1000 events. 583/1000 cut-off events. For 221/226 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4902 event pairs, 121 based on Foata normal form. 111/1092 useless extension candidates. Maximal degree in co-relation 2270. Up to 525 conditions per place. [2023-11-19 07:45:49,160 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 45 selfloop transitions, 7 changer transitions 4/61 dead transitions. [2023-11-19 07:45:49,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 61 transitions, 293 flow [2023-11-19 07:45:49,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:45:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:45:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2023-11-19 07:45:49,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009009009009009 [2023-11-19 07:45:49,164 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 556 transitions. [2023-11-19 07:45:49,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 556 transitions. [2023-11-19 07:45:49,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:49,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 556 transitions. [2023-11-19 07:45:49,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:49,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:49,174 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:49,175 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 93 flow. Second operand 5 states and 556 transitions. [2023-11-19 07:45:49,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 61 transitions, 293 flow [2023-11-19 07:45:49,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:49,182 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 141 flow [2023-11-19 07:45:49,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-19 07:45:49,185 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-11-19 07:45:49,185 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 141 flow [2023-11-19 07:45:49,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:49,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:49,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:49,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:45:49,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:49,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:49,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1757544712, now seen corresponding path program 1 times [2023-11-19 07:45:49,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:49,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283304984] [2023-11-19 07:45:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:49,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:49,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:49,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283304984] [2023-11-19 07:45:49,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283304984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:49,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:49,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:45:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53066654] [2023-11-19 07:45:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:49,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:45:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:45:49,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:45:49,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-11-19 07:45:49,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:49,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:49,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-11-19 07:45:49,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:49,772 INFO L124 PetriNetUnfolderBase]: 447/806 cut-off events. [2023-11-19 07:45:49,773 INFO L125 PetriNetUnfolderBase]: For 448/449 co-relation queries the response was YES. [2023-11-19 07:45:49,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2342 conditions, 806 events. 447/806 cut-off events. For 448/449 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3983 event pairs, 82 based on Foata normal form. 57/846 useless extension candidates. Maximal degree in co-relation 2324. Up to 248 conditions per place. [2023-11-19 07:45:49,781 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 53 selfloop transitions, 13 changer transitions 12/83 dead transitions. [2023-11-19 07:45:49,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 83 transitions, 463 flow [2023-11-19 07:45:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:45:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:45:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions. [2023-11-19 07:45:49,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006435006435006 [2023-11-19 07:45:49,785 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 778 transitions. [2023-11-19 07:45:49,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 778 transitions. [2023-11-19 07:45:49,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:49,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 778 transitions. [2023-11-19 07:45:49,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:49,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:49,794 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:49,794 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 141 flow. Second operand 7 states and 778 transitions. [2023-11-19 07:45:49,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 83 transitions, 463 flow [2023-11-19 07:45:49,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 459 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:45:49,801 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 225 flow [2023-11-19 07:45:49,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-11-19 07:45:49,802 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-11-19 07:45:49,803 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 225 flow [2023-11-19 07:45:49,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:49,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:49,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:49,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:45:49,804 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:49,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1531780171, now seen corresponding path program 1 times [2023-11-19 07:45:49,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:49,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852534147] [2023-11-19 07:45:49,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:49,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:50,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:50,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852534147] [2023-11-19 07:45:50,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852534147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:50,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:50,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:45:50,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046634525] [2023-11-19 07:45:50,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:50,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:45:50,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:50,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:45:50,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:45:50,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 222 [2023-11-19 07:45:50,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:50,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:50,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 222 [2023-11-19 07:45:50,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:50,514 INFO L124 PetriNetUnfolderBase]: 411/745 cut-off events. [2023-11-19 07:45:50,515 INFO L125 PetriNetUnfolderBase]: For 942/942 co-relation queries the response was YES. [2023-11-19 07:45:50,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 745 events. 411/745 cut-off events. For 942/942 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3688 event pairs, 79 based on Foata normal form. 13/741 useless extension candidates. Maximal degree in co-relation 2393. Up to 223 conditions per place. [2023-11-19 07:45:50,522 INFO L140 encePairwiseOnDemand]: 216/222 looper letters, 50 selfloop transitions, 17 changer transitions 11/83 dead transitions. [2023-11-19 07:45:50,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 521 flow [2023-11-19 07:45:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:45:50,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 07:45:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 978 transitions. [2023-11-19 07:45:50,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894894894894895 [2023-11-19 07:45:50,527 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 978 transitions. [2023-11-19 07:45:50,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 978 transitions. [2023-11-19 07:45:50,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:50,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 978 transitions. [2023-11-19 07:45:50,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.66666666666667) internal successors, (978), 9 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:50,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:50,538 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:50,538 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 225 flow. Second operand 9 states and 978 transitions. [2023-11-19 07:45:50,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 521 flow [2023-11-19 07:45:50,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 468 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-11-19 07:45:50,555 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 234 flow [2023-11-19 07:45:50,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=234, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2023-11-19 07:45:50,559 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2023-11-19 07:45:50,559 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 234 flow [2023-11-19 07:45:50,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:50,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:50,560 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] [2023-11-19 07:45:50,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:45:50,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:50,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:50,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1815408128, now seen corresponding path program 1 times [2023-11-19 07:45:50,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:50,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531818636] [2023-11-19 07:45:50,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:50,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:50,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:50,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531818636] [2023-11-19 07:45:50,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531818636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:50,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:50,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604604671] [2023-11-19 07:45:50,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:50,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:50,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:50,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:50,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:50,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 222 [2023-11-19 07:45:50,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:50,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:50,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 222 [2023-11-19 07:45:50,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:51,146 INFO L124 PetriNetUnfolderBase]: 641/1175 cut-off events. [2023-11-19 07:45:51,147 INFO L125 PetriNetUnfolderBase]: For 2015/2015 co-relation queries the response was YES. [2023-11-19 07:45:51,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3784 conditions, 1175 events. 641/1175 cut-off events. For 2015/2015 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6437 event pairs, 131 based on Foata normal form. 1/1165 useless extension candidates. Maximal degree in co-relation 3761. Up to 610 conditions per place. [2023-11-19 07:45:51,156 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 50 selfloop transitions, 2 changer transitions 26/82 dead transitions. [2023-11-19 07:45:51,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 693 flow [2023-11-19 07:45:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:45:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-11-19 07:45:51,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078828828828829 [2023-11-19 07:45:51,159 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-11-19 07:45:51,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-11-19 07:45:51,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:51,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-11-19 07:45:51,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:51,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:51,164 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:51,164 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 234 flow. Second operand 4 states and 451 transitions. [2023-11-19 07:45:51,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 693 flow [2023-11-19 07:45:51,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 556 flow, removed 30 selfloop flow, removed 8 redundant places. [2023-11-19 07:45:51,180 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 166 flow [2023-11-19 07:45:51,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2023-11-19 07:45:51,182 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2023-11-19 07:45:51,182 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 166 flow [2023-11-19 07:45:51,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:51,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:51,182 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] [2023-11-19 07:45:51,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:45:51,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:51,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:51,183 INFO L85 PathProgramCache]: Analyzing trace with hash 982012326, now seen corresponding path program 2 times [2023-11-19 07:45:51,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:51,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070219923] [2023-11-19 07:45:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:45:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:45:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:45:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070219923] [2023-11-19 07:45:51,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070219923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:45:51,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:45:51,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:45:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372851246] [2023-11-19 07:45:51,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:45:51,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:45:51,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:45:51,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:45:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:45:51,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 222 [2023-11-19 07:45:51,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:51,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:45:51,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 222 [2023-11-19 07:45:51,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:45:51,815 INFO L124 PetriNetUnfolderBase]: 589/1142 cut-off events. [2023-11-19 07:45:51,815 INFO L125 PetriNetUnfolderBase]: For 1046/1046 co-relation queries the response was YES. [2023-11-19 07:45:51,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3360 conditions, 1142 events. 589/1142 cut-off events. For 1046/1046 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6660 event pairs, 123 based on Foata normal form. 1/1131 useless extension candidates. Maximal degree in co-relation 3339. Up to 579 conditions per place. [2023-11-19 07:45:51,823 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 29 selfloop transitions, 1 changer transitions 40/73 dead transitions. [2023-11-19 07:45:51,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 481 flow [2023-11-19 07:45:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:45:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:45:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-11-19 07:45:51,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056306306306306 [2023-11-19 07:45:51,827 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-11-19 07:45:51,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-11-19 07:45:51,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:45:51,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-11-19 07:45:51,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:51,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:51,834 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:51,834 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 166 flow. Second operand 4 states and 449 transitions. [2023-11-19 07:45:51,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 481 flow [2023-11-19 07:45:51,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 475 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 07:45:51,854 INFO L231 Difference]: Finished difference. Result has 53 places, 28 transitions, 127 flow [2023-11-19 07:45:51,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=53, PETRI_TRANSITIONS=28} [2023-11-19 07:45:51,856 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2023-11-19 07:45:51,856 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 28 transitions, 127 flow [2023-11-19 07:45:51,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:45:51,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:45:51,857 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] [2023-11-19 07:45:51,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:45:51,857 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 07:45:51,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:45:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1774588902, now seen corresponding path program 3 times [2023-11-19 07:45:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:45:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929116286] [2023-11-19 07:45:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:45:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:45:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:45:51,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:45:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:45:52,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:45:52,036 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:45:52,037 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 07:45:52,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 07:45:52,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 07:45:52,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 07:45:52,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 07:45:52,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 07:45:52,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:45:52,041 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:45:52,048 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:45:52,048 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:45:52,108 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:45:52,113 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:45:52,117 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 07:45:52,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:45:52 BasicIcfg [2023-11-19 07:45:52,152 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:45:52,152 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:45:52,152 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:45:52,153 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:45:52,153 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:45:39" (3/4) ... [2023-11-19 07:45:52,154 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:45:52,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:45:52,197 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:45:52,198 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 07:45:52,259 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:45:52,259 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:45:52,260 INFO L158 Benchmark]: Toolchain (without parser) took 14396.30ms. Allocated memory was 138.4MB in the beginning and 314.6MB in the end (delta: 176.2MB). Free memory was 95.2MB in the beginning and 180.8MB in the end (delta: -85.6MB). Peak memory consumption was 92.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:52,260 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 100.7MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:45:52,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.14ms. Allocated memory is still 138.4MB. Free memory was 94.8MB in the beginning and 70.5MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:52,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.41ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 70.5MB in the beginning and 150.6MB in the end (delta: -80.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2023-11-19 07:45:52,261 INFO L158 Benchmark]: Boogie Preprocessor took 75.26ms. Allocated memory is still 180.4MB. Free memory was 150.6MB in the beginning and 148.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:45:52,262 INFO L158 Benchmark]: RCFGBuilder took 916.26ms. Allocated memory is still 180.4MB. Free memory was 148.7MB in the beginning and 109.9MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-19 07:45:52,262 INFO L158 Benchmark]: TraceAbstraction took 12449.86ms. Allocated memory was 180.4MB in the beginning and 314.6MB in the end (delta: 134.2MB). Free memory was 108.8MB in the beginning and 192.3MB in the end (delta: -83.5MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2023-11-19 07:45:52,263 INFO L158 Benchmark]: Witness Printer took 107.18ms. Allocated memory is still 314.6MB. Free memory was 192.3MB in the beginning and 180.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 07:45:52,265 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.45ms. Allocated memory is still 100.7MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.14ms. Allocated memory is still 138.4MB. Free memory was 94.8MB in the beginning and 70.5MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.41ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 70.5MB in the beginning and 150.6MB in the end (delta: -80.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.26ms. Allocated memory is still 180.4MB. Free memory was 150.6MB in the beginning and 148.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 916.26ms. Allocated memory is still 180.4MB. Free memory was 148.7MB in the beginning and 109.9MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12449.86ms. Allocated memory was 180.4MB in the beginning and 314.6MB in the end (delta: 134.2MB). Free memory was 108.8MB in the beginning and 192.3MB in the end (delta: -83.5MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * Witness Printer took 107.18ms. Allocated memory is still 314.6MB. Free memory was 192.3MB in the beginning and 180.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 123 PlacesBefore, 34 PlacesAfterwards, 115 TransitionsBefore, 25 TransitionsAfterwards, 2402 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 5839 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2690, independent: 2493, independent conditional: 0, independent unconditional: 2493, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1315, independent: 1279, independent conditional: 0, independent unconditional: 1279, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2690, independent: 1214, independent conditional: 0, independent unconditional: 1214, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 1315, unknown conditional: 0, unknown unconditional: 1315] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L728] 0 _Bool y$flush_delayed; [L729] 0 int y$mem_tmp; [L730] 0 _Bool y$r_buff0_thd0; [L731] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$r_buff0_thd2; [L733] 0 _Bool y$r_buff0_thd3; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$read_delayed; [L739] 0 int *y$read_delayed_var; [L740] 0 int y$w_buff0; [L741] 0 _Bool y$w_buff0_used; [L742] 0 int y$w_buff1; [L743] 0 _Bool y$w_buff1_used; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t17; [L854] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t18; [L856] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t19; [L858] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 y$w_buff1 = y$w_buff0 [L801] 3 y$w_buff0 = 1 [L802] 3 y$w_buff1_used = y$w_buff0_used [L803] 3 y$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L805] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L806] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L807] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L808] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L809] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 y$flush_delayed = weak$$choice2 [L815] 3 y$mem_tmp = y [L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = y [L824] 3 y = y$flush_delayed ? y$mem_tmp : y [L825] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L828] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L751] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L772] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, 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: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 340 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 255 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 775 IncrementalHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 55 mSDtfsCounter, 775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=8, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 07:45:52,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c039e6d-cfef-4345-b7d5-166fd06706b2/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE