./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya --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 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:41:06,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:41:06,600 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:41:06,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:41:06,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:41:06,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:41:06,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:41:06,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:41:06,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:41:06,631 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:41:06,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:41:06,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:41:06,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:41:06,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:41:06,634 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:41:06,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:41:06,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:41:06,635 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:41:06,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:41:06,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:41:06,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:41:06,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:41:06,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:41:06,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:41:06,639 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:41:06,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:41:06,640 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:41:06,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:41:06,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:41:06,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:41:06,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:41:06,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:41:06,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:41:06,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:41:06,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:41:06,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:41:06,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:41:06,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:41:06,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:41:06,643 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:41:06,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:41:06,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:41:06,644 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_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/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_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2023-11-29 05:41:06,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:41:06,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:41:06,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:41:06,903 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:41:06,903 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:41:06,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2023-11-29 05:41:09,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:41:09,943 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:41:09,944 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2023-11-29 05:41:09,976 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/data/5bf66231e/3efd893c402b458da148de1fcf4b8160/FLAGcd0c3d16d [2023-11-29 05:41:09,991 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/data/5bf66231e/3efd893c402b458da148de1fcf4b8160 [2023-11-29 05:41:09,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:41:09,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:41:09,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:41:09,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:41:10,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:41:10,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:41:09" (1/1) ... [2023-11-29 05:41:10,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79ebbdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10, skipping insertion in model container [2023-11-29 05:41:10,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:41:09" (1/1) ... [2023-11-29 05:41:10,120 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:41:10,564 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_451de494-3a72-4b02-80c5-756067549252/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[186294,186307] [2023-11-29 05:41:10,598 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:41:10,609 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:41:10,648 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_451de494-3a72-4b02-80c5-756067549252/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[186294,186307] [2023-11-29 05:41:10,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:41:10,707 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:41:10,708 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:41:10,715 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:41:10,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10 WrapperNode [2023-11-29 05:41:10,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:41:10,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:41:10,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:41:10,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:41:10,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,770 INFO L138 Inliner]: procedures = 246, calls = 51, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 135 [2023-11-29 05:41:10,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:41:10,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:41:10,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:41:10,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:41:10,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,802 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 3, 3, 13, 2]. 57 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1, 0, 0]. The 10 writes are split as follows [0, 1, 1, 6, 2]. [2023-11-29 05:41:10,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,803 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:41:10,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:41:10,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:41:10,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:41:10,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (1/1) ... [2023-11-29 05:41:10,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:41:10,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:41:10,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:41:10,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:41:10,906 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-11-29 05:41:10,907 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-11-29 05:41:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:41:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:41:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:41:10,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:41:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:41:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:41:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:41:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 05:41:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 05:41:10,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:41:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:41:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:41:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:41:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:41:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:41:10,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:41:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:41:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:41:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 05:41:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 05:41:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:41:10,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:41:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:41:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:41:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:41:10,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:41:10,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:41:10,913 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:41:11,164 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:41:11,166 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:41:11,389 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:41:11,544 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:41:11,544 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:41:11,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:41:11 BoogieIcfgContainer [2023-11-29 05:41:11,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:41:11,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:41:11,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:41:11,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:41:11,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:41:09" (1/3) ... [2023-11-29 05:41:11,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e18919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:41:11, skipping insertion in model container [2023-11-29 05:41:11,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:41:10" (2/3) ... [2023-11-29 05:41:11,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76e18919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:41:11, skipping insertion in model container [2023-11-29 05:41:11,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:41:11" (3/3) ... [2023-11-29 05:41:11,554 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2023-11-29 05:41:11,563 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 05:41:11,573 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:41:11,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-29 05:41:11,574 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:41:11,617 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 05:41:11,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2023-11-29 05:41:11,677 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2023-11-29 05:41:11,677 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 05:41:11,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 10/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 146 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2023-11-29 05:41:11,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2023-11-29 05:41:11,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2023-11-29 05:41:11,693 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:41:11,699 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;@48bc8878, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:41:11,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-29 05:41:11,702 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:41:11,702 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2023-11-29 05:41:11,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:41:11,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:11,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-29 05:41:11,703 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:11,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash 13490038, now seen corresponding path program 1 times [2023-11-29 05:41:11,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783099108] [2023-11-29 05:41:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:11,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:12,126 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-29 05:41:12,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:12,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783099108] [2023-11-29 05:41:12,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783099108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:12,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:12,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:41:12,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454190687] [2023-11-29 05:41:12,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:12,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:41:12,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:41:12,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:41:12,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2023-11-29 05:41:12,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:12,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:41:12,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2023-11-29 05:41:12,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:41:12,455 INFO L124 PetriNetUnfolderBase]: 466/824 cut-off events. [2023-11-29 05:41:12,455 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 05:41:12,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 824 events. 466/824 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3434 event pairs, 345 based on Foata normal form. 3/823 useless extension candidates. Maximal degree in co-relation 1539. Up to 602 conditions per place. [2023-11-29 05:41:12,465 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2023-11-29 05:41:12,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2023-11-29 05:41:12,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:41:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:41:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2023-11-29 05:41:12,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-11-29 05:41:12,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 84 transitions. [2023-11-29 05:41:12,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 84 transitions. [2023-11-29 05:41:12,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:41:12,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 84 transitions. [2023-11-29 05:41:12,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:12,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:12,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:12,487 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2023-11-29 05:41:12,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2023-11-29 05:41:12,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:41:12,494 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2023-11-29 05:41:12,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-11-29 05:41:12,499 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-11-29 05:41:12,499 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2023-11-29 05:41:12,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:12,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:12,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 05:41:12,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:41:12,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:12,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:12,501 INFO L85 PathProgramCache]: Analyzing trace with hash 79092242, now seen corresponding path program 1 times [2023-11-29 05:41:12,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:12,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148661785] [2023-11-29 05:41:12,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:12,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:12,662 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-29 05:41:12,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:12,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148661785] [2023-11-29 05:41:12,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148661785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:12,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:12,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:41:12,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632997127] [2023-11-29 05:41:12,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:12,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:41:12,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:12,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:41:12,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:41:12,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2023-11-29 05:41:12,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:12,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:41:12,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2023-11-29 05:41:12,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:41:12,938 INFO L124 PetriNetUnfolderBase]: 466/811 cut-off events. [2023-11-29 05:41:12,939 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-11-29 05:41:12,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 811 events. 466/811 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3338 event pairs, 199 based on Foata normal form. 1/811 useless extension candidates. Maximal degree in co-relation 813. Up to 578 conditions per place. [2023-11-29 05:41:12,947 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 45 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2023-11-29 05:41:12,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 257 flow [2023-11-29 05:41:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:41:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:41:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2023-11-29 05:41:12,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3566666666666667 [2023-11-29 05:41:12,950 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 107 transitions. [2023-11-29 05:41:12,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 107 transitions. [2023-11-29 05:41:12,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:41:12,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 107 transitions. [2023-11-29 05:41:12,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:12,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:12,953 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 60.0) internal successors, (360), 6 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:12,954 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 107 transitions. [2023-11-29 05:41:12,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 257 flow [2023-11-29 05:41:12,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:41:12,957 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2023-11-29 05:41:12,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-11-29 05:41:12,958 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-11-29 05:41:12,959 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2023-11-29 05:41:12,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:12,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:12,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:41:12,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:41:12,959 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:12,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash 998087258, now seen corresponding path program 1 times [2023-11-29 05:41:12,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:12,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133392196] [2023-11-29 05:41:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:13,250 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-29 05:41:13,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133392196] [2023-11-29 05:41:13,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133392196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:13,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:13,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:41:13,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615583926] [2023-11-29 05:41:13,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:13,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:41:13,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:13,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:41:13,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:41:13,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2023-11-29 05:41:13,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:13,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:41:13,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2023-11-29 05:41:13,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:41:13,552 INFO L124 PetriNetUnfolderBase]: 602/1095 cut-off events. [2023-11-29 05:41:13,553 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2023-11-29 05:41:13,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 1095 events. 602/1095 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5234 event pairs, 251 based on Foata normal form. 69/1163 useless extension candidates. Maximal degree in co-relation 332. Up to 575 conditions per place. [2023-11-29 05:41:13,561 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 47 selfloop transitions, 12 changer transitions 4/67 dead transitions. [2023-11-29 05:41:13,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2023-11-29 05:41:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:41:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:41:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2023-11-29 05:41:13,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2023-11-29 05:41:13,563 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 102 transitions. [2023-11-29 05:41:13,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 102 transitions. [2023-11-29 05:41:13,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:41:13,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 102 transitions. [2023-11-29 05:41:13,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:13,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:13,566 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:13,567 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2023-11-29 05:41:13,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2023-11-29 05:41:13,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:41:13,570 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 166 flow [2023-11-29 05:41:13,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-11-29 05:41:13,571 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2023-11-29 05:41:13,571 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 166 flow [2023-11-29 05:41:13,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:13,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:13,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:41:13,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:41:13,572 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:13,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1703945492, now seen corresponding path program 1 times [2023-11-29 05:41:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:13,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080182548] [2023-11-29 05:41:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:13,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:13,691 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-29 05:41:13,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:13,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080182548] [2023-11-29 05:41:13,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080182548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:41:13,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540110425] [2023-11-29 05:41:13,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:13,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:41:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:41:13,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:41:13,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2023-11-29 05:41:13,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:13,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:41:13,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2023-11-29 05:41:13,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:41:13,859 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2023-11-29 05:41:13,859 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2023-11-29 05:41:13,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 408 events. 225/408 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1469 event pairs, 39 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 983. Up to 217 conditions per place. [2023-11-29 05:41:13,863 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2023-11-29 05:41:13,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 290 flow [2023-11-29 05:41:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:41:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:41:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2023-11-29 05:41:13,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2023-11-29 05:41:13,865 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 131 transitions. [2023-11-29 05:41:13,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 131 transitions. [2023-11-29 05:41:13,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:41:13,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 131 transitions. [2023-11-29 05:41:13,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:13,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:13,868 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:13,868 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 166 flow. Second operand 4 states and 131 transitions. [2023-11-29 05:41:13,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 290 flow [2023-11-29 05:41:13,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 58 transitions, 272 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:41:13,871 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 104 flow [2023-11-29 05:41:13,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2023-11-29 05:41:13,872 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-11-29 05:41:13,873 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 104 flow [2023-11-29 05:41:13,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:13,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:13,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:41:13,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:41:13,874 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:13,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:13,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1246575540, now seen corresponding path program 1 times [2023-11-29 05:41:13,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331330362] [2023-11-29 05:41:13,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:14,703 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-29 05:41:14,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:14,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331330362] [2023-11-29 05:41:14,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331330362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:14,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:14,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:41:14,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820022028] [2023-11-29 05:41:14,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:14,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:41:14,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:14,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:41:14,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:41:14,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2023-11-29 05:41:14,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:14,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:41:14,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2023-11-29 05:41:14,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:41:15,193 INFO L124 PetriNetUnfolderBase]: 263/492 cut-off events. [2023-11-29 05:41:15,193 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2023-11-29 05:41:15,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 492 events. 263/492 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1822 event pairs, 19 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 280. Up to 147 conditions per place. [2023-11-29 05:41:15,198 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 64 selfloop transitions, 21 changer transitions 0/87 dead transitions. [2023-11-29 05:41:15,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 429 flow [2023-11-29 05:41:15,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:41:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 05:41:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2023-11-29 05:41:15,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28194444444444444 [2023-11-29 05:41:15,200 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 203 transitions. [2023-11-29 05:41:15,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 203 transitions. [2023-11-29 05:41:15,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:41:15,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 203 transitions. [2023-11-29 05:41:15,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 16.916666666666668) internal successors, (203), 12 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:15,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 60.0) internal successors, (780), 13 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:15,205 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 60.0) internal successors, (780), 13 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:15,205 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 104 flow. Second operand 12 states and 203 transitions. [2023-11-29 05:41:15,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 429 flow [2023-11-29 05:41:15,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:41:15,210 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 207 flow [2023-11-29 05:41:15,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=207, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-29 05:41:15,211 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-11-29 05:41:15,212 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 207 flow [2023-11-29 05:41:15,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:15,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:15,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:41:15,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:41:15,213 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:15,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1316031936, now seen corresponding path program 2 times [2023-11-29 05:41:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908675971] [2023-11-29 05:41:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:16,329 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-29 05:41:16,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908675971] [2023-11-29 05:41:16,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908675971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:16,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:16,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:41:16,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139296984] [2023-11-29 05:41:16,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:16,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:41:16,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:16,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:41:16,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:41:16,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2023-11-29 05:41:16,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 207 flow. Second operand has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:16,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:41:16,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2023-11-29 05:41:16,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:41:16,959 INFO L124 PetriNetUnfolderBase]: 447/860 cut-off events. [2023-11-29 05:41:16,959 INFO L125 PetriNetUnfolderBase]: For 945/945 co-relation queries the response was YES. [2023-11-29 05:41:16,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 860 events. 447/860 cut-off events. For 945/945 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4104 event pairs, 33 based on Foata normal form. 2/862 useless extension candidates. Maximal degree in co-relation 2452. Up to 186 conditions per place. [2023-11-29 05:41:16,968 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 91 selfloop transitions, 36 changer transitions 0/129 dead transitions. [2023-11-29 05:41:16,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 129 transitions, 807 flow [2023-11-29 05:41:16,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:41:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-29 05:41:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 260 transitions. [2023-11-29 05:41:16,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28888888888888886 [2023-11-29 05:41:16,971 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 260 transitions. [2023-11-29 05:41:16,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 260 transitions. [2023-11-29 05:41:16,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:41:16,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 260 transitions. [2023-11-29 05:41:16,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 17.333333333333332) internal successors, (260), 15 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:16,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 60.0) internal successors, (960), 16 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:16,975 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 60.0) internal successors, (960), 16 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:16,975 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 207 flow. Second operand 15 states and 260 transitions. [2023-11-29 05:41:16,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 129 transitions, 807 flow [2023-11-29 05:41:16,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 129 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:41:16,985 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 451 flow [2023-11-29 05:41:16,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=451, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2023-11-29 05:41:16,986 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2023-11-29 05:41:16,986 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 451 flow [2023-11-29 05:41:16,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:16,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:16,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:41:16,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:41:16,987 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:16,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash 864432894, now seen corresponding path program 3 times [2023-11-29 05:41:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088033735] [2023-11-29 05:41:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:16,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:17,779 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-29 05:41:17,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:17,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088033735] [2023-11-29 05:41:17,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088033735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:17,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:17,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:41:17,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300853807] [2023-11-29 05:41:17,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:17,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:41:17,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:17,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:41:17,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:41:17,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2023-11-29 05:41:17,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 451 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:17,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:41:17,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2023-11-29 05:41:17,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:41:18,671 INFO L124 PetriNetUnfolderBase]: 662/1279 cut-off events. [2023-11-29 05:41:18,671 INFO L125 PetriNetUnfolderBase]: For 2915/2915 co-relation queries the response was YES. [2023-11-29 05:41:18,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 1279 events. 662/1279 cut-off events. For 2915/2915 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6760 event pairs, 53 based on Foata normal form. 1/1280 useless extension candidates. Maximal degree in co-relation 4209. Up to 277 conditions per place. [2023-11-29 05:41:18,685 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 104 selfloop transitions, 54 changer transitions 0/160 dead transitions. [2023-11-29 05:41:18,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1242 flow [2023-11-29 05:41:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:41:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-29 05:41:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 292 transitions. [2023-11-29 05:41:18,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28627450980392155 [2023-11-29 05:41:18,688 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 292 transitions. [2023-11-29 05:41:18,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 292 transitions. [2023-11-29 05:41:18,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:41:18,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 292 transitions. [2023-11-29 05:41:18,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 17.176470588235293) internal successors, (292), 17 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:18,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 60.0) internal successors, (1080), 18 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:18,692 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 60.0) internal successors, (1080), 18 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:18,693 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 451 flow. Second operand 17 states and 292 transitions. [2023-11-29 05:41:18,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1242 flow [2023-11-29 05:41:18,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 160 transitions, 1233 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:41:18,709 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 813 flow [2023-11-29 05:41:18,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=813, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2023-11-29 05:41:18,710 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2023-11-29 05:41:18,710 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 813 flow [2023-11-29 05:41:18,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:18,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:18,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:41:18,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:41:18,711 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:18,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:18,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1171626358, now seen corresponding path program 4 times [2023-11-29 05:41:18,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:18,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741493951] [2023-11-29 05:41:18,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:19,453 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-29 05:41:19,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741493951] [2023-11-29 05:41:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741493951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:19,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:19,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:41:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885508492] [2023-11-29 05:41:19,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:19,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:41:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:41:19,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:41:19,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2023-11-29 05:41:19,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 813 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:19,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:41:19,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2023-11-29 05:41:19,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:41:20,236 INFO L124 PetriNetUnfolderBase]: 662/1277 cut-off events. [2023-11-29 05:41:20,236 INFO L125 PetriNetUnfolderBase]: For 5019/5019 co-relation queries the response was YES. [2023-11-29 05:41:20,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4726 conditions, 1277 events. 662/1277 cut-off events. For 5019/5019 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6765 event pairs, 71 based on Foata normal form. 1/1278 useless extension candidates. Maximal degree in co-relation 4663. Up to 417 conditions per place. [2023-11-29 05:41:20,249 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 102 selfloop transitions, 58 changer transitions 0/161 dead transitions. [2023-11-29 05:41:20,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 161 transitions, 1455 flow [2023-11-29 05:41:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:41:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-29 05:41:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 291 transitions. [2023-11-29 05:41:20,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2852941176470588 [2023-11-29 05:41:20,252 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 291 transitions. [2023-11-29 05:41:20,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 291 transitions. [2023-11-29 05:41:20,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:41:20,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 291 transitions. [2023-11-29 05:41:20,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 17.11764705882353) internal successors, (291), 17 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:20,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 60.0) internal successors, (1080), 18 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:20,256 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 60.0) internal successors, (1080), 18 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:20,256 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 813 flow. Second operand 17 states and 291 transitions. [2023-11-29 05:41:20,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 161 transitions, 1455 flow [2023-11-29 05:41:20,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 161 transitions, 1411 flow, removed 1 selfloop flow, removed 9 redundant places. [2023-11-29 05:41:20,285 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 1007 flow [2023-11-29 05:41:20,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1007, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2023-11-29 05:41:20,286 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2023-11-29 05:41:20,286 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 1007 flow [2023-11-29 05:41:20,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:20,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:20,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:41:20,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:41:20,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:20,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1701275531, now seen corresponding path program 1 times [2023-11-29 05:41:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:20,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265946689] [2023-11-29 05:41:20,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:20,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:21,681 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-29 05:41:21,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:21,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265946689] [2023-11-29 05:41:21,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265946689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:21,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:21,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 05:41:21,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120705910] [2023-11-29 05:41:21,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:21,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:41:21,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:41:21,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:41:21,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2023-11-29 05:41:21,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 1007 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:21,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:41:21,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2023-11-29 05:41:21,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:41:22,788 INFO L124 PetriNetUnfolderBase]: 826/1579 cut-off events. [2023-11-29 05:41:22,788 INFO L125 PetriNetUnfolderBase]: For 8500/8500 co-relation queries the response was YES. [2023-11-29 05:41:22,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6317 conditions, 1579 events. 826/1579 cut-off events. For 8500/8500 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8758 event pairs, 260 based on Foata normal form. 1/1580 useless extension candidates. Maximal degree in co-relation 5535. Up to 966 conditions per place. [2023-11-29 05:41:22,806 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 97 selfloop transitions, 71 changer transitions 33/202 dead transitions. [2023-11-29 05:41:22,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 202 transitions, 2318 flow [2023-11-29 05:41:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:41:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-29 05:41:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 305 transitions. [2023-11-29 05:41:22,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2675438596491228 [2023-11-29 05:41:22,809 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 305 transitions. [2023-11-29 05:41:22,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 305 transitions. [2023-11-29 05:41:22,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:41:22,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 305 transitions. [2023-11-29 05:41:22,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 16.05263157894737) internal successors, (305), 19 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:22,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 60.0) internal successors, (1200), 20 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:22,815 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 60.0) internal successors, (1200), 20 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:22,815 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 1007 flow. Second operand 19 states and 305 transitions. [2023-11-29 05:41:22,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 202 transitions, 2318 flow [2023-11-29 05:41:22,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 202 transitions, 2254 flow, removed 3 selfloop flow, removed 8 redundant places. [2023-11-29 05:41:22,857 INFO L231 Difference]: Finished difference. Result has 117 places, 135 transitions, 1639 flow [2023-11-29 05:41:22,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1639, PETRI_PLACES=117, PETRI_TRANSITIONS=135} [2023-11-29 05:41:22,858 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2023-11-29 05:41:22,859 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 135 transitions, 1639 flow [2023-11-29 05:41:22,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:22,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:22,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:41:22,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:41:22,860 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:22,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1547114673, now seen corresponding path program 2 times [2023-11-29 05:41:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845991883] [2023-11-29 05:41:22,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:24,211 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-29 05:41:24,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:24,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845991883] [2023-11-29 05:41:24,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845991883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:24,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:24,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 05:41:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346182625] [2023-11-29 05:41:24,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:24,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 05:41:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:24,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 05:41:24,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:41:24,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2023-11-29 05:41:24,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 135 transitions, 1639 flow. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:24,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:41:24,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2023-11-29 05:41:24,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:41:25,484 INFO L124 PetriNetUnfolderBase]: 935/1824 cut-off events. [2023-11-29 05:41:25,484 INFO L125 PetriNetUnfolderBase]: For 11941/11941 co-relation queries the response was YES. [2023-11-29 05:41:25,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8148 conditions, 1824 events. 935/1824 cut-off events. For 11941/11941 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10836 event pairs, 315 based on Foata normal form. 2/1826 useless extension candidates. Maximal degree in co-relation 8081. Up to 1234 conditions per place. [2023-11-29 05:41:25,504 INFO L140 encePairwiseOnDemand]: 44/60 looper letters, 121 selfloop transitions, 88 changer transitions 32/242 dead transitions. [2023-11-29 05:41:25,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 242 transitions, 3006 flow [2023-11-29 05:41:25,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 05:41:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-29 05:41:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 355 transitions. [2023-11-29 05:41:25,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2689393939393939 [2023-11-29 05:41:25,508 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 355 transitions. [2023-11-29 05:41:25,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 355 transitions. [2023-11-29 05:41:25,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:41:25,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 355 transitions. [2023-11-29 05:41:25,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 16.136363636363637) internal successors, (355), 22 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:25,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 60.0) internal successors, (1380), 23 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:25,513 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 60.0) internal successors, (1380), 23 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:25,513 INFO L175 Difference]: Start difference. First operand has 117 places, 135 transitions, 1639 flow. Second operand 22 states and 355 transitions. [2023-11-29 05:41:25,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 242 transitions, 3006 flow [2023-11-29 05:41:25,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 242 transitions, 2758 flow, removed 105 selfloop flow, removed 7 redundant places. [2023-11-29 05:41:25,593 INFO L231 Difference]: Finished difference. Result has 137 places, 170 transitions, 2184 flow [2023-11-29 05:41:25,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2184, PETRI_PLACES=137, PETRI_TRANSITIONS=170} [2023-11-29 05:41:25,594 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 84 predicate places. [2023-11-29 05:41:25,594 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 170 transitions, 2184 flow [2023-11-29 05:41:25,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:25,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:25,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:41:25,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:41:25,595 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:25,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:25,596 INFO L85 PathProgramCache]: Analyzing trace with hash -728439245, now seen corresponding path program 3 times [2023-11-29 05:41:25,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:25,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35999682] [2023-11-29 05:41:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:25,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:26,533 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-29 05:41:26,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:41:26,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35999682] [2023-11-29 05:41:26,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35999682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:41:26,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:41:26,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:41:26,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240729903] [2023-11-29 05:41:26,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:41:26,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:41:26,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:41:26,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:41:26,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:41:26,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2023-11-29 05:41:26,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 170 transitions, 2184 flow. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:26,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:41:26,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2023-11-29 05:41:26,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:41:27,647 INFO L124 PetriNetUnfolderBase]: 973/1984 cut-off events. [2023-11-29 05:41:27,648 INFO L125 PetriNetUnfolderBase]: For 13740/13740 co-relation queries the response was YES. [2023-11-29 05:41:27,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8969 conditions, 1984 events. 973/1984 cut-off events. For 13740/13740 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 12332 event pairs, 423 based on Foata normal form. 2/1986 useless extension candidates. Maximal degree in co-relation 8912. Up to 864 conditions per place. [2023-11-29 05:41:27,663 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 165 selfloop transitions, 82 changer transitions 31/279 dead transitions. [2023-11-29 05:41:27,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 279 transitions, 3754 flow [2023-11-29 05:41:27,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 05:41:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-29 05:41:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 357 transitions. [2023-11-29 05:41:27,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27045454545454545 [2023-11-29 05:41:27,665 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 357 transitions. [2023-11-29 05:41:27,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 357 transitions. [2023-11-29 05:41:27,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:41:27,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 357 transitions. [2023-11-29 05:41:27,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 16.227272727272727) internal successors, (357), 22 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:27,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 60.0) internal successors, (1380), 23 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:27,670 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 60.0) internal successors, (1380), 23 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:27,670 INFO L175 Difference]: Start difference. First operand has 137 places, 170 transitions, 2184 flow. Second operand 22 states and 357 transitions. [2023-11-29 05:41:27,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 279 transitions, 3754 flow [2023-11-29 05:41:27,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 279 transitions, 3512 flow, removed 57 selfloop flow, removed 12 redundant places. [2023-11-29 05:41:27,729 INFO L231 Difference]: Finished difference. Result has 149 places, 183 transitions, 2435 flow [2023-11-29 05:41:27,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2001, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2435, PETRI_PLACES=149, PETRI_TRANSITIONS=183} [2023-11-29 05:41:27,730 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 96 predicate places. [2023-11-29 05:41:27,730 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 183 transitions, 2435 flow [2023-11-29 05:41:27,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:41:27,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:41:27,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:41:27,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:41:27,731 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-29 05:41:27,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:27,731 INFO L85 PathProgramCache]: Analyzing trace with hash 486871383, now seen corresponding path program 4 times [2023-11-29 05:41:27,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:41:27,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851839461] [2023-11-29 05:41:27,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:27,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:41:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:41:27,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:41:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:41:27,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:41:27,820 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:41:27,821 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-11-29 05:41:27,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-11-29 05:41:27,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-11-29 05:41:27,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-11-29 05:41:27,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-11-29 05:41:27,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-11-29 05:41:27,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-11-29 05:41:27,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-11-29 05:41:27,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:41:27,824 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1] [2023-11-29 05:41:27,828 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:41:27,828 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:41:27,865 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:41:27,866 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:41:27,868 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-29 05:41:27,868 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet14 [2023-11-29 05:41:27,869 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet16 [2023-11-29 05:41:27,869 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-29 05:41:27,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:41:27 BasicIcfg [2023-11-29 05:41:27,880 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:41:27,881 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:41:27,881 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:41:27,881 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:41:27,881 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:41:11" (3/4) ... [2023-11-29 05:41:27,882 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 05:41:27,902 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:41:27,902 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:41:27,904 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-29 05:41:27,904 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet14 [2023-11-29 05:41:27,905 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-29 05:41:27,905 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet16 [2023-11-29 05:41:27,947 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:41:27,947 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:41:27,948 INFO L158 Benchmark]: Toolchain (without parser) took 17952.86ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 112.0MB in the beginning and 140.4MB in the end (delta: -28.4MB). Peak memory consumption was 209.4MB. Max. memory is 16.1GB. [2023-11-29 05:41:27,948 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:41:27,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 719.71ms. Allocated memory is still 155.2MB. Free memory was 112.0MB in the beginning and 78.2MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-29 05:41:27,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.37ms. Allocated memory is still 155.2MB. Free memory was 78.2MB in the beginning and 75.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:41:27,949 INFO L158 Benchmark]: Boogie Preprocessor took 57.93ms. Allocated memory is still 155.2MB. Free memory was 75.5MB in the beginning and 71.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:41:27,950 INFO L158 Benchmark]: RCFGBuilder took 715.49ms. Allocated memory is still 155.2MB. Free memory was 71.3MB in the beginning and 109.9MB in the end (delta: -38.6MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2023-11-29 05:41:27,950 INFO L158 Benchmark]: TraceAbstraction took 16332.87ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 109.3MB in the beginning and 148.8MB in the end (delta: -39.4MB). Peak memory consumption was 196.5MB. Max. memory is 16.1GB. [2023-11-29 05:41:27,951 INFO L158 Benchmark]: Witness Printer took 66.52ms. Allocated memory is still 390.1MB. Free memory was 148.8MB in the beginning and 140.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 05:41:27,953 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.18ms. Allocated memory is still 117.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 719.71ms. Allocated memory is still 155.2MB. Free memory was 112.0MB in the beginning and 78.2MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.37ms. Allocated memory is still 155.2MB. Free memory was 78.2MB in the beginning and 75.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.93ms. Allocated memory is still 155.2MB. Free memory was 75.5MB in the beginning and 71.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 715.49ms. Allocated memory is still 155.2MB. Free memory was 71.3MB in the beginning and 109.9MB in the end (delta: -38.6MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16332.87ms. Allocated memory was 155.2MB in the beginning and 390.1MB in the end (delta: 234.9MB). Free memory was 109.3MB in the beginning and 148.8MB in the end (delta: -39.4MB). Peak memory consumption was 196.5MB. Max. memory is 16.1GB. * Witness Printer took 66.52ms. Allocated memory is still 390.1MB. Free memory was 148.8MB in the beginning and 140.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet14 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet16 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet14 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet16 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3888] 0 pthread_t t1,t2; [L3888] 0 pthread_t t1,t2; [L3888] 0 pthread_t t1,t2; [L3901] 0 struct device *my_dev; [L3953] CALL, EXPR 0 my_drv_init() [L3947] 0 return 0; [L3953] RET, EXPR 0 my_drv_init() [L3953] 0 int ret = my_drv_init(); [L3954] COND TRUE 0 ret==0 [L3955] 0 int probe_ret; [L3956] 0 struct my_data data; [L3957] CALL, EXPR 0 my_drv_probe(&data) [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] EXPR 0 data->shared.a [L3925] CALL 0 ldv_assert(data->shared.a==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1={3:0}, t2={4:0}] [L3925] RET 0 ldv_assert(data->shared.a==0) [L3926] EXPR 0 data->shared.b [L3926] CALL 0 ldv_assert(data->shared.b==0) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1={3:0}, t2={4:0}] [L3926] RET 0 ldv_assert(data->shared.b==0) [L3927] 0 int res = __VERIFIER_nondet_int(); [L3928] COND FALSE 0 !(\read(res)) [L3931] 0 my_dev = &data->dev [L3933] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, res=0, t1={3:0}, t2={4:0}] [L3934] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, res=0, t1={3:0}, t2={4:0}] [L3935] 0 return 0; VAL [\result=0, arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, res=0, t1={3:0}, t2={4:0}] [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L3917] 1 return 0; [L3957] RET, EXPR 0 my_drv_probe(&data) [L3957] 0 probe_ret = my_drv_probe(&data) [L3958] COND TRUE 0 probe_ret==0 [L3959] CALL 0 my_drv_disconnect(&data) [L3941] 0 void *status; [L3942] 0 \read(t1) VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L3942] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L3943] 0 \read(t2) VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L3914] 2 data->shared.b = lb + 1 VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L3917] 2 return 0; [L3943] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L3959] RET 0 my_drv_disconnect(&data) [L3960] EXPR 0 data.shared.a [L3960] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(expression)=1, \result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, expression=1, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L3960] RET 0 ldv_assert(data.shared.a==1) [L3961] EXPR 0 data.shared.b [L3961] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, expression=0, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L3887] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={0:0}, arg={0:0}, data={6:0}, expression=0, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 3887]: 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: 3887]: 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: 3887]: 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: 3887]: 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: 3887]: 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: 3933]: 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: 3934]: 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 4 procedures, 60 locations, 8 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: 16.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1360 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1260 mSDsluCounter, 1190 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1123 mSDsCounter, 232 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3657 IncrementalHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 232 mSolverCounterUnsat, 67 mSDtfsCounter, 3657 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2435occurred in iteration=11, InterpolantAutomatonStates: 140, 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.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 2794 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-29 05:41:27,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451de494-3a72-4b02-80c5-756067549252/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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