./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 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_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl --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 d974e781ffea1b31efc329a775e4694ebddd3772fc019bafad0898da50a9d8c1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:16:30,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:16:30,806 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:16:30,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:16:30,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:16:30,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:16:30,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:16:30,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:16:30,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:16:30,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:16:30,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:16:30,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:16:30,863 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:16:30,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:16:30,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:16:30,865 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:16:30,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:16:30,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:16:30,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:16:30,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:16:30,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:16:30,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:16:30,868 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:16:30,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:16:30,869 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:16:30,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:16:30,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:16:30,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:16:30,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:16:30,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:16:30,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:16:30,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:16:30,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:16:30,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:16:30,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:16:30,873 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:16:30,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:16:30,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:16:30,874 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:16:30,874 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_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/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_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl 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 -> d974e781ffea1b31efc329a775e4694ebddd3772fc019bafad0898da50a9d8c1 [2023-11-12 02:16:31,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:16:31,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:16:31,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:16:31,253 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:16:31,253 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:16:31,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:16:34,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:16:34,831 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:16:34,834 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:16:34,862 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/data/c91c7eb81/efed609f77474e538d24a2585084bd94/FLAG83217449d [2023-11-12 02:16:34,881 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/data/c91c7eb81/efed609f77474e538d24a2585084bd94 [2023-11-12 02:16:34,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:16:34,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:16:34,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:16:34,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:16:34,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:16:34,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:16:34" (1/1) ... [2023-11-12 02:16:34,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7437e538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:34, skipping insertion in model container [2023-11-12 02:16:34,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:16:34" (1/1) ... [2023-11-12 02:16:34,958 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:16:35,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_c6a74ce1-3dda-4edd-b98b-23192b822f4c/sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-12 02:16:35,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:16:35,544 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:16:35,570 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_c6a74ce1-3dda-4edd-b98b-23192b822f4c/sv-benchmarks/c/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-12 02:16:35,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:16:35,697 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:35,697 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:16:35,707 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:16:35,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35 WrapperNode [2023-11-12 02:16:35,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:16:35,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:16:35,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:16:35,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:16:35,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (1/1) ... [2023-11-12 02:16:35,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (1/1) ... [2023-11-12 02:16:35,820 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-12 02:16:35,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:16:35,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:16:35,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:16:35,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:16:35,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (1/1) ... [2023-11-12 02:16:35,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (1/1) ... [2023-11-12 02:16:35,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (1/1) ... [2023-11-12 02:16:35,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (1/1) ... [2023-11-12 02:16:35,883 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (1/1) ... [2023-11-12 02:16:35,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (1/1) ... [2023-11-12 02:16:35,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (1/1) ... [2023-11-12 02:16:35,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (1/1) ... [2023-11-12 02:16:35,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:16:35,913 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:16:35,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:16:35,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:16:35,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (1/1) ... [2023-11-12 02:16:35,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:16:35,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:35,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:16:36,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:16:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:16:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:16:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:16:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:16:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:16:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:16:36,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:16:36,025 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:16:36,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:16:36,026 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:16:36,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:16:36,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:16:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:16:36,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:16:36,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:16:36,031 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:16:36,248 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:16:36,251 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:16:36,781 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:16:37,073 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:16:37,073 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:16:37,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:37 BoogieIcfgContainer [2023-11-12 02:16:37,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:16:37,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:16:37,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:16:37,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:16:37,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:16:34" (1/3) ... [2023-11-12 02:16:37,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edd2244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:16:37, skipping insertion in model container [2023-11-12 02:16:37,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:35" (2/3) ... [2023-11-12 02:16:37,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edd2244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:16:37, skipping insertion in model container [2023-11-12 02:16:37,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:37" (3/3) ... [2023-11-12 02:16:37,097 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:16:37,109 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:16:37,123 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:16:37,123 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 02:16:37,123 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:16:37,210 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:16:37,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 236 flow [2023-11-12 02:16:37,369 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-11-12 02:16:37,370 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:16:37,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-12 02:16:37,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 236 flow [2023-11-12 02:16:37,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-11-12 02:16:37,388 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:16:37,404 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-11-12 02:16:37,407 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-11-12 02:16:37,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-11-12 02:16:37,441 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-11-12 02:16:37,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:16:37,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-12 02:16:37,445 INFO L119 LiptonReduction]: Number of co-enabled transitions 2192 [2023-11-12 02:16:42,204 INFO L134 LiptonReduction]: Checked pairs total: 6369 [2023-11-12 02:16:42,204 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-11-12 02:16:42,239 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:16:42,261 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;@1e21c5ca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:16:42,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-12 02:16:42,265 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:16:42,266 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-11-12 02:16:42,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:16:42,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:42,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-12 02:16:42,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:16:42,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:42,276 INFO L85 PathProgramCache]: Analyzing trace with hash 484525, now seen corresponding path program 1 times [2023-11-12 02:16:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:42,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177870516] [2023-11-12 02:16:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:42,883 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-12 02:16:42,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:42,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177870516] [2023-11-12 02:16:42,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177870516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:42,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:42,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:16:42,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948933595] [2023-11-12 02:16:42,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:42,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:16:42,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:42,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:42,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:42,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 206 [2023-11-12 02:16:42,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 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-12 02:16:42,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:42,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 206 [2023-11-12 02:16:42,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:43,569 INFO L124 PetriNetUnfolderBase]: 1263/1902 cut-off events. [2023-11-12 02:16:43,569 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-12 02:16:43,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3813 conditions, 1902 events. 1263/1902 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8852 event pairs, 562 based on Foata normal form. 80/1814 useless extension candidates. Maximal degree in co-relation 3802. Up to 1510 conditions per place. [2023-11-12 02:16:43,598 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 33 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-11-12 02:16:43,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 177 flow [2023-11-12 02:16:43,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:16:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-11-12 02:16:43,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5436893203883495 [2023-11-12 02:16:43,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-11-12 02:16:43,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-11-12 02:16:43,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:43,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-11-12 02:16:43,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-12 02:16:43,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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-12 02:16:43,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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-12 02:16:43,654 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 336 transitions. [2023-11-12 02:16:43,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 177 flow [2023-11-12 02:16:43,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:16:43,662 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-11-12 02:16:43,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-11-12 02:16:43,669 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-11-12 02:16:43,669 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-11-12 02:16:43,670 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-12 02:16:43,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:43,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:43,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:16:43,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:16:43,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash -551940110, now seen corresponding path program 1 times [2023-11-12 02:16:43,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:43,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667109633] [2023-11-12 02:16:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:44,089 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-12 02:16:44,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:44,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667109633] [2023-11-12 02:16:44,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667109633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:44,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:44,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:16:44,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579386168] [2023-11-12 02:16:44,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:44,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:16:44,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:44,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:16:44,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:16:44,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 206 [2023-11-12 02:16:44,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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-12 02:16:44,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:44,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 206 [2023-11-12 02:16:44,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:45,369 INFO L124 PetriNetUnfolderBase]: 3262/4867 cut-off events. [2023-11-12 02:16:45,370 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-12 02:16:45,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10086 conditions, 4867 events. 3262/4867 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25217 event pairs, 950 based on Foata normal form. 258/5125 useless extension candidates. Maximal degree in co-relation 10076. Up to 2242 conditions per place. [2023-11-12 02:16:45,412 INFO L140 encePairwiseOnDemand]: 197/206 looper letters, 34 selfloop transitions, 7 changer transitions 27/68 dead transitions. [2023-11-12 02:16:45,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 68 transitions, 290 flow [2023-11-12 02:16:45,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:16:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:16:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2023-11-12 02:16:45,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49514563106796117 [2023-11-12 02:16:45,418 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 510 transitions. [2023-11-12 02:16:45,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 510 transitions. [2023-11-12 02:16:45,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:45,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 510 transitions. [2023-11-12 02:16:45,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:45,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-12 02:16:45,435 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-12 02:16:45,435 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 510 transitions. [2023-11-12 02:16:45,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 68 transitions, 290 flow [2023-11-12 02:16:45,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 68 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:16:45,442 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 122 flow [2023-11-12 02:16:45,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-11-12 02:16:45,444 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-11-12 02:16:45,452 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 122 flow [2023-11-12 02:16:45,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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-12 02:16:45,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:45,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:45,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:16:45,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:16:45,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash 69758314, now seen corresponding path program 1 times [2023-11-12 02:16:45,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:45,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026442103] [2023-11-12 02:16:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:45,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:45,696 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-12 02:16:45,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:45,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026442103] [2023-11-12 02:16:45,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026442103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:45,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:45,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:45,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78333167] [2023-11-12 02:16:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:45,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:16:45,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:45,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:16:45,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:16:45,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 206 [2023-11-12 02:16:45,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 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-12 02:16:45,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:45,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 206 [2023-11-12 02:16:45,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:47,192 INFO L124 PetriNetUnfolderBase]: 2968/4482 cut-off events. [2023-11-12 02:16:47,193 INFO L125 PetriNetUnfolderBase]: For 3593/3593 co-relation queries the response was YES. [2023-11-12 02:16:47,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12474 conditions, 4482 events. 2968/4482 cut-off events. For 3593/3593 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 23405 event pairs, 271 based on Foata normal form. 213/4695 useless extension candidates. Maximal degree in co-relation 12460. Up to 2120 conditions per place. [2023-11-12 02:16:47,244 INFO L140 encePairwiseOnDemand]: 197/206 looper letters, 41 selfloop transitions, 11 changer transitions 32/84 dead transitions. [2023-11-12 02:16:47,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 84 transitions, 488 flow [2023-11-12 02:16:47,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:16:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:16:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions. [2023-11-12 02:16:47,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4840499306518724 [2023-11-12 02:16:47,249 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 698 transitions. [2023-11-12 02:16:47,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 698 transitions. [2023-11-12 02:16:47,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:47,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 698 transitions. [2023-11-12 02:16:47,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 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-12 02:16:47,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 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-12 02:16:47,260 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 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-12 02:16:47,260 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 122 flow. Second operand 7 states and 698 transitions. [2023-11-12 02:16:47,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 84 transitions, 488 flow [2023-11-12 02:16:47,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 84 transitions, 446 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-12 02:16:47,283 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 190 flow [2023-11-12 02:16:47,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-11-12 02:16:47,286 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2023-11-12 02:16:47,290 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 190 flow [2023-11-12 02:16:47,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 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-12 02:16:47,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:47,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:47,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:16:47,291 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:16:47,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:47,293 INFO L85 PathProgramCache]: Analyzing trace with hash 69749665, now seen corresponding path program 1 times [2023-11-12 02:16:47,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:47,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146184502] [2023-11-12 02:16:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:47,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:47,576 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-12 02:16:47,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:47,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146184502] [2023-11-12 02:16:47,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146184502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:47,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:47,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:47,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928881624] [2023-11-12 02:16:47,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:47,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:16:47,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:47,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:16:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:16:47,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 206 [2023-11-12 02:16:47,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 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-12 02:16:47,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:47,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 206 [2023-11-12 02:16:47,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:48,734 INFO L124 PetriNetUnfolderBase]: 2857/4320 cut-off events. [2023-11-12 02:16:48,735 INFO L125 PetriNetUnfolderBase]: For 10203/10203 co-relation queries the response was YES. [2023-11-12 02:16:48,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13596 conditions, 4320 events. 2857/4320 cut-off events. For 10203/10203 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22351 event pairs, 435 based on Foata normal form. 212/4532 useless extension candidates. Maximal degree in co-relation 13576. Up to 2007 conditions per place. [2023-11-12 02:16:48,792 INFO L140 encePairwiseOnDemand]: 197/206 looper letters, 47 selfloop transitions, 15 changer transitions 32/94 dead transitions. [2023-11-12 02:16:48,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 94 transitions, 622 flow [2023-11-12 02:16:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:16:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:16:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 706 transitions. [2023-11-12 02:16:48,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895977808599168 [2023-11-12 02:16:48,797 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 706 transitions. [2023-11-12 02:16:48,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 706 transitions. [2023-11-12 02:16:48,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:48,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 706 transitions. [2023-11-12 02:16:48,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.85714285714286) internal successors, (706), 7 states have internal predecessors, (706), 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-12 02:16:48,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 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-12 02:16:48,808 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 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-12 02:16:48,808 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 190 flow. Second operand 7 states and 706 transitions. [2023-11-12 02:16:48,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 94 transitions, 622 flow [2023-11-12 02:16:48,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 94 transitions, 606 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-12 02:16:48,856 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 279 flow [2023-11-12 02:16:48,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=279, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-11-12 02:16:48,859 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2023-11-12 02:16:48,859 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 279 flow [2023-11-12 02:16:48,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 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-12 02:16:48,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:48,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:48,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:16:48,861 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:16:48,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2132435671, now seen corresponding path program 1 times [2023-11-12 02:16:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:48,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467044362] [2023-11-12 02:16:48,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:48,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:49,183 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-12 02:16:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:49,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467044362] [2023-11-12 02:16:49,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467044362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:49,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:49,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:16:49,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823854170] [2023-11-12 02:16:49,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:49,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:16:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:49,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:16:49,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:16:49,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-11-12 02:16:49,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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-12 02:16:49,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:49,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-11-12 02:16:49,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:50,178 INFO L124 PetriNetUnfolderBase]: 2196/3471 cut-off events. [2023-11-12 02:16:50,178 INFO L125 PetriNetUnfolderBase]: For 9488/9615 co-relation queries the response was YES. [2023-11-12 02:16:50,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11293 conditions, 3471 events. 2196/3471 cut-off events. For 9488/9615 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18673 event pairs, 648 based on Foata normal form. 240/3689 useless extension candidates. Maximal degree in co-relation 11268. Up to 2296 conditions per place. [2023-11-12 02:16:50,227 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 37 selfloop transitions, 3 changer transitions 19/68 dead transitions. [2023-11-12 02:16:50,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 527 flow [2023-11-12 02:16:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:16:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:16:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 523 transitions. [2023-11-12 02:16:50,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5077669902912622 [2023-11-12 02:16:50,232 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 523 transitions. [2023-11-12 02:16:50,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 523 transitions. [2023-11-12 02:16:50,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:50,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 523 transitions. [2023-11-12 02:16:50,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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-12 02:16:50,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-12 02:16:50,239 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-12 02:16:50,239 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 279 flow. Second operand 5 states and 523 transitions. [2023-11-12 02:16:50,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 527 flow [2023-11-12 02:16:50,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 507 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-12 02:16:50,333 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 280 flow [2023-11-12 02:16:50,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-11-12 02:16:50,335 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2023-11-12 02:16:50,335 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 280 flow [2023-11-12 02:16:50,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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-12 02:16:50,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:50,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:50,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:16:50,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:16:50,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash -913565223, now seen corresponding path program 1 times [2023-11-12 02:16:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:50,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051660343] [2023-11-12 02:16:50,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:50,517 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-12 02:16:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:50,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051660343] [2023-11-12 02:16:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051660343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:50,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:16:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506429818] [2023-11-12 02:16:50,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:50,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:16:50,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:50,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:50,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-11-12 02:16:50,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 280 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-12 02:16:50,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:50,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-11-12 02:16:50,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:50,945 INFO L124 PetriNetUnfolderBase]: 870/1530 cut-off events. [2023-11-12 02:16:50,945 INFO L125 PetriNetUnfolderBase]: For 2853/2969 co-relation queries the response was YES. [2023-11-12 02:16:50,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4879 conditions, 1530 events. 870/1530 cut-off events. For 2853/2969 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8080 event pairs, 197 based on Foata normal form. 122/1642 useless extension candidates. Maximal degree in co-relation 4853. Up to 1204 conditions per place. [2023-11-12 02:16:50,963 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 44 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2023-11-12 02:16:50,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 486 flow [2023-11-12 02:16:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:16:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-11-12 02:16:50,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.517799352750809 [2023-11-12 02:16:50,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-11-12 02:16:50,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-11-12 02:16:50,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:50,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-11-12 02:16:50,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-12 02:16:50,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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-12 02:16:50,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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-12 02:16:50,970 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 280 flow. Second operand 3 states and 320 transitions. [2023-11-12 02:16:50,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 486 flow [2023-11-12 02:16:50,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 474 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-12 02:16:50,980 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 294 flow [2023-11-12 02:16:50,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-11-12 02:16:50,981 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-11-12 02:16:50,982 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 294 flow [2023-11-12 02:16:50,982 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-12 02:16:50,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:50,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:50,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:16:50,983 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:16:50,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:50,983 INFO L85 PathProgramCache]: Analyzing trace with hash -729377650, now seen corresponding path program 1 times [2023-11-12 02:16:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:50,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383409941] [2023-11-12 02:16:50,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:50,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:51,270 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-12 02:16:51,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:51,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383409941] [2023-11-12 02:16:51,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383409941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:51,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:51,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:51,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682336957] [2023-11-12 02:16:51,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:51,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:16:51,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:16:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:16:51,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 206 [2023-11-12 02:16:51,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 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-12 02:16:51,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:51,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 206 [2023-11-12 02:16:51,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:52,018 INFO L124 PetriNetUnfolderBase]: 1366/2435 cut-off events. [2023-11-12 02:16:52,018 INFO L125 PetriNetUnfolderBase]: For 4589/4672 co-relation queries the response was YES. [2023-11-12 02:16:52,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8365 conditions, 2435 events. 1366/2435 cut-off events. For 4589/4672 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14305 event pairs, 543 based on Foata normal form. 98/2518 useless extension candidates. Maximal degree in co-relation 8340. Up to 1205 conditions per place. [2023-11-12 02:16:52,041 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 45 selfloop transitions, 7 changer transitions 22/79 dead transitions. [2023-11-12 02:16:52,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 613 flow [2023-11-12 02:16:52,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:16:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:16:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2023-11-12 02:16:52,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5097087378640777 [2023-11-12 02:16:52,045 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2023-11-12 02:16:52,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2023-11-12 02:16:52,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:52,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2023-11-12 02:16:52,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 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-12 02:16:52,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-12 02:16:52,052 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-12 02:16:52,052 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 294 flow. Second operand 5 states and 525 transitions. [2023-11-12 02:16:52,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 613 flow [2023-11-12 02:16:52,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 606 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:16:52,066 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 300 flow [2023-11-12 02:16:52,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-11-12 02:16:52,067 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-11-12 02:16:52,068 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 300 flow [2023-11-12 02:16:52,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 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-12 02:16:52,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:52,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:52,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:16:52,070 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:16:52,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:52,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1419159599, now seen corresponding path program 1 times [2023-11-12 02:16:52,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:52,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42691053] [2023-11-12 02:16:52,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:52,305 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-12 02:16:52,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:52,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42691053] [2023-11-12 02:16:52,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42691053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:52,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:52,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:52,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420584301] [2023-11-12 02:16:52,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:52,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:16:52,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:52,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:16:52,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:16:52,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-11-12 02:16:52,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:52,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:52,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-11-12 02:16:52,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:52,656 INFO L124 PetriNetUnfolderBase]: 513/1016 cut-off events. [2023-11-12 02:16:52,656 INFO L125 PetriNetUnfolderBase]: For 1829/1871 co-relation queries the response was YES. [2023-11-12 02:16:52,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 1016 events. 513/1016 cut-off events. For 1829/1871 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5534 event pairs, 127 based on Foata normal form. 138/1143 useless extension candidates. Maximal degree in co-relation 3501. Up to 329 conditions per place. [2023-11-12 02:16:52,672 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 55 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2023-11-12 02:16:52,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 616 flow [2023-11-12 02:16:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:16:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:16:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2023-11-12 02:16:52,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182038834951457 [2023-11-12 02:16:52,676 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2023-11-12 02:16:52,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2023-11-12 02:16:52,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:52,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2023-11-12 02:16:52,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-12 02:16:52,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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-12 02:16:52,682 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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-12 02:16:52,683 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 300 flow. Second operand 4 states and 427 transitions. [2023-11-12 02:16:52,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 616 flow [2023-11-12 02:16:52,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 573 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-12 02:16:52,692 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 314 flow [2023-11-12 02:16:52,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-12 02:16:52,697 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2023-11-12 02:16:52,697 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 314 flow [2023-11-12 02:16:52,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:52,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:52,698 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-12 02:16:52,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:16:52,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:16:52,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash -90563324, now seen corresponding path program 1 times [2023-11-12 02:16:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:52,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013164373] [2023-11-12 02:16:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:52,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:53,122 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-12 02:16:53,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:53,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013164373] [2023-11-12 02:16:53,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013164373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:53,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:16:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319605465] [2023-11-12 02:16:53,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:53,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:16:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:53,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:16:53,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:16:53,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-11-12 02:16:53,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 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-12 02:16:53,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:53,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-11-12 02:16:53,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:53,487 INFO L124 PetriNetUnfolderBase]: 425/820 cut-off events. [2023-11-12 02:16:53,487 INFO L125 PetriNetUnfolderBase]: For 1572/1603 co-relation queries the response was YES. [2023-11-12 02:16:53,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3117 conditions, 820 events. 425/820 cut-off events. For 1572/1603 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4316 event pairs, 113 based on Foata normal form. 56/865 useless extension candidates. Maximal degree in co-relation 3090. Up to 320 conditions per place. [2023-11-12 02:16:53,495 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 45 selfloop transitions, 10 changer transitions 10/71 dead transitions. [2023-11-12 02:16:53,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 601 flow [2023-11-12 02:16:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:16:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:16:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2023-11-12 02:16:53,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067961165048543 [2023-11-12 02:16:53,500 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2023-11-12 02:16:53,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2023-11-12 02:16:53,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:53,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2023-11-12 02:16:53,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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-12 02:16:53,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-12 02:16:53,509 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-12 02:16:53,509 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 314 flow. Second operand 5 states and 522 transitions. [2023-11-12 02:16:53,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 601 flow [2023-11-12 02:16:53,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 572 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-11-12 02:16:53,519 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 271 flow [2023-11-12 02:16:53,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-11-12 02:16:53,521 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-11-12 02:16:53,521 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 271 flow [2023-11-12 02:16:53,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 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-12 02:16:53,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:53,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:53,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:16:53,523 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:16:53,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1392635897, now seen corresponding path program 1 times [2023-11-12 02:16:53,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:53,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912899309] [2023-11-12 02:16:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:53,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:55,509 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-12 02:16:55,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:55,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912899309] [2023-11-12 02:16:55,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912899309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:55,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:55,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:16:55,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869496948] [2023-11-12 02:16:55,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:55,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:16:55,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:55,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:16:55,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:16:55,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 206 [2023-11-12 02:16:55,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 271 flow. Second operand has 8 states, 8 states have (on average 94.5) internal successors, (756), 8 states have internal predecessors, (756), 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-12 02:16:55,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:16:55,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 206 [2023-11-12 02:16:55,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:16:56,052 INFO L124 PetriNetUnfolderBase]: 238/477 cut-off events. [2023-11-12 02:16:56,052 INFO L125 PetriNetUnfolderBase]: For 1111/1128 co-relation queries the response was YES. [2023-11-12 02:16:56,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 477 events. 238/477 cut-off events. For 1111/1128 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2112 event pairs, 34 based on Foata normal form. 8/482 useless extension candidates. Maximal degree in co-relation 1875. Up to 239 conditions per place. [2023-11-12 02:16:56,056 INFO L140 encePairwiseOnDemand]: 199/206 looper letters, 48 selfloop transitions, 4 changer transitions 21/79 dead transitions. [2023-11-12 02:16:56,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 674 flow [2023-11-12 02:16:56,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:16:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:16:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 785 transitions. [2023-11-12 02:16:56,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47633495145631066 [2023-11-12 02:16:56,061 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 785 transitions. [2023-11-12 02:16:56,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 785 transitions. [2023-11-12 02:16:56,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:56,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 785 transitions. [2023-11-12 02:16:56,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.125) internal successors, (785), 8 states have internal predecessors, (785), 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-12 02:16:56,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 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-12 02:16:56,070 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 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-12 02:16:56,070 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 271 flow. Second operand 8 states and 785 transitions. [2023-11-12 02:16:56,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 674 flow [2023-11-12 02:16:56,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 561 flow, removed 21 selfloop flow, removed 9 redundant places. [2023-11-12 02:16:56,077 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 230 flow [2023-11-12 02:16:56,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=230, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2023-11-12 02:16:56,078 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-11-12 02:16:56,078 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 230 flow [2023-11-12 02:16:56,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.5) internal successors, (756), 8 states have internal predecessors, (756), 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-12 02:16:56,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:16:56,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:56,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:16:56,080 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-12 02:16:56,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1854881375, now seen corresponding path program 2 times [2023-11-12 02:16:56,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821583227] [2023-11-12 02:16:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:56,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:56,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:56,236 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:16:56,238 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-12 02:16:56,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-12 02:16:56,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-12 02:16:56,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-12 02:16:56,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-12 02:16:56,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-12 02:16:56,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:16:56,241 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:56,248 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:16:56,248 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:16:56,299 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:16:56,301 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:16:56,303 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:16:56,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:16:56 BasicIcfg [2023-11-12 02:16:56,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:16:56,327 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:16:56,327 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:16:56,327 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:16:56,328 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:37" (3/4) ... [2023-11-12 02:16:56,329 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:16:56,356 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:16:56,357 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:16:56,358 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:16:56,428 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:16:56,429 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:16:56,429 INFO L158 Benchmark]: Toolchain (without parser) took 21543.29ms. Allocated memory was 132.1MB in the beginning and 790.6MB in the end (delta: 658.5MB). Free memory was 90.2MB in the beginning and 241.8MB in the end (delta: -151.6MB). Peak memory consumption was 508.0MB. Max. memory is 16.1GB. [2023-11-12 02:16:56,430 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 132.1MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:16:56,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 821.04ms. Allocated memory is still 132.1MB. Free memory was 89.7MB in the beginning and 66.4MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:16:56,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.09ms. Allocated memory is still 132.1MB. Free memory was 66.4MB in the beginning and 64.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:16:56,431 INFO L158 Benchmark]: Boogie Preprocessor took 86.31ms. Allocated memory is still 132.1MB. Free memory was 64.0MB in the beginning and 62.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:16:56,432 INFO L158 Benchmark]: RCFGBuilder took 1168.04ms. Allocated memory was 132.1MB in the beginning and 167.8MB in the end (delta: 35.7MB). Free memory was 62.1MB in the beginning and 114.2MB in the end (delta: -52.1MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2023-11-12 02:16:56,433 INFO L158 Benchmark]: TraceAbstraction took 19241.65ms. Allocated memory was 167.8MB in the beginning and 790.6MB in the end (delta: 622.9MB). Free memory was 113.1MB in the beginning and 252.3MB in the end (delta: -139.2MB). Peak memory consumption was 482.5MB. Max. memory is 16.1GB. [2023-11-12 02:16:56,433 INFO L158 Benchmark]: Witness Printer took 101.76ms. Allocated memory is still 790.6MB. Free memory was 252.3MB in the beginning and 241.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 02:16:56,436 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.34ms. Allocated memory is still 132.1MB. Free memory is still 103.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 821.04ms. Allocated memory is still 132.1MB. Free memory was 89.7MB in the beginning and 66.4MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.09ms. Allocated memory is still 132.1MB. Free memory was 66.4MB in the beginning and 64.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.31ms. Allocated memory is still 132.1MB. Free memory was 64.0MB in the beginning and 62.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1168.04ms. Allocated memory was 132.1MB in the beginning and 167.8MB in the end (delta: 35.7MB). Free memory was 62.1MB in the beginning and 114.2MB in the end (delta: -52.1MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19241.65ms. Allocated memory was 167.8MB in the beginning and 790.6MB in the end (delta: 622.9MB). Free memory was 113.1MB in the beginning and 252.3MB in the end (delta: -139.2MB). Peak memory consumption was 482.5MB. Max. memory is 16.1GB. * Witness Printer took 101.76ms. Allocated memory is still 790.6MB. Free memory was 252.3MB in the beginning and 241.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - 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 The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 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, 117 PlacesBefore, 36 PlacesAfterwards, 109 TransitionsBefore, 27 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 6369 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3072, independent: 2867, independent conditional: 0, independent unconditional: 2867, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1168, independent: 1134, independent conditional: 0, independent unconditional: 1134, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3072, independent: 1733, independent conditional: 0, independent unconditional: 1733, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 1168, unknown conditional: 0, unknown unconditional: 1168] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L836] 0 pthread_t t745; [L837] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t746; [L839] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, t746={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t747; [L841] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __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=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L856] 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_p2_EAX=2, __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=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: 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: 841]: 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: 837]: 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, 140 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: 19.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 437 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 331 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1200 IncrementalHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 61 mSDtfsCounter, 1200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=8, InterpolantAutomatonStates: 52, 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.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 739 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-12 02:16:56,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c6a74ce1-3dda-4edd-b98b-23192b822f4c/bin/uautomizer-verify-uTZkv6EMXl/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